./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5c5150a720fdced1e7cf7a03c2f6f18e193ebaeb85e2a46b50fbe0597998c07 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:14:15,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:14:16,069 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:14:16,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:14:16,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:14:16,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:14:16,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:14:16,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:14:16,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:14:16,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:14:16,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:14:16,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:14:16,130 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:14:16,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:14:16,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:14:16,133 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:14:16,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:14:16,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:14:16,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:14:16,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:14:16,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:14:16,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:14:16,136 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:14:16,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:14:16,137 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:14:16,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:14:16,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:14:16,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:14:16,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:16,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:14:16,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:14:16,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:14:16,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:14:16,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:14:16,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:14:16,143 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:14:16,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:14:16,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:14:16,144 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:14:16,145 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5c5150a720fdced1e7cf7a03c2f6f18e193ebaeb85e2a46b50fbe0597998c07 [2023-11-12 02:14:16,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:14:16,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:14:16,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:14:16,494 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:14:16,495 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:14:16,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i [2023-11-12 02:14:19,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:14:20,079 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:14:20,084 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i [2023-11-12 02:14:20,099 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/data/c8e4537b5/b9c5034e2edd47559bcfbd5015ca88c8/FLAG98aba0580 [2023-11-12 02:14:20,116 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/data/c8e4537b5/b9c5034e2edd47559bcfbd5015ca88c8 [2023-11-12 02:14:20,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:14:20,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:14:20,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:20,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:14:20,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:14:20,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413f7520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20, skipping insertion in model container [2023-11-12 02:14:20,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,187 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:14:20,390 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i[916,929] [2023-11-12 02:14:20,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:20,522 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:14:20,545 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i[916,929] [2023-11-12 02:14:20,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:20,631 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:14:20,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20 WrapperNode [2023-11-12 02:14:20,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:20,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:20,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:14:20,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:14:20,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,738 INFO L138 Inliner]: procedures = 29, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2023-11-12 02:14:20,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:20,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:14:20,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:14:20,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:14:20,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:14:20,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:14:20,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:14:20,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:14:20,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (1/1) ... [2023-11-12 02:14:20,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:20,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:20,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:20,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:14:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:14:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-12 02:14:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:14:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-12 02:14:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:14:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-12 02:14:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:14:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:14:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:14:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:14:20,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:14:21,074 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:14:21,077 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:14:21,761 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:14:21,769 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:14:21,770 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:14:21,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:21 BoogieIcfgContainer [2023-11-12 02:14:21,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:14:21,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:14:21,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:14:21,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:14:21,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:14:20" (1/3) ... [2023-11-12 02:14:21,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f3d2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:21, skipping insertion in model container [2023-11-12 02:14:21,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:20" (2/3) ... [2023-11-12 02:14:21,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f3d2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:21, skipping insertion in model container [2023-11-12 02:14:21,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:21" (3/3) ... [2023-11-12 02:14:21,784 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-84.i [2023-11-12 02:14:21,807 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:14:21,807 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:14:21,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:14:21,873 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6eed3fe4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:14:21,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:14:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:14:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-12 02:14:21,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:21,904 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:21,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:14:21,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash 924800917, now seen corresponding path program 1 times [2023-11-12 02:14:21,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586511507] [2023-11-12 02:14:21,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:14:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:14:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:14:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:14:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:14:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:14:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:14:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:14:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:14:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:14:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:14:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:14:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:14:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:14:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:14:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:14:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:14:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:14:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:14:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:14:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:14:22,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:22,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586511507] [2023-11-12 02:14:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586511507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:22,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:22,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:14:22,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148063586] [2023-11-12 02:14:22,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:22,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:14:22,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:22,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:14:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:14:22,661 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-12 02:14:22,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:22,710 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2023-11-12 02:14:22,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:14:22,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2023-11-12 02:14:22,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:22,727 INFO L225 Difference]: With dead ends: 199 [2023-11-12 02:14:22,727 INFO L226 Difference]: Without dead ends: 99 [2023-11-12 02:14:22,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:14:22,736 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:22,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:14:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-12 02:14:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-12 02:14:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:14:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-11-12 02:14:22,825 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2023-11-12 02:14:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:22,825 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-11-12 02:14:22,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-12 02:14:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-11-12 02:14:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-12 02:14:22,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:22,831 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:22,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:14:22,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:14:22,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1032707065, now seen corresponding path program 1 times [2023-11-12 02:14:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:22,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826011959] [2023-11-12 02:14:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:14:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:14:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:14:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:14:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:14:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:14:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:14:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:14:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:14:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:14:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:14:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:14:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:14:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:14:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:14:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:14:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:14:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:14:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:14:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:14:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:14:23,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:23,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826011959] [2023-11-12 02:14:23,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826011959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:23,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:23,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:14:23,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135453597] [2023-11-12 02:14:23,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:23,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:14:23,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:23,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:14:23,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:14:23,283 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:14:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:23,392 INFO L93 Difference]: Finished difference Result 199 states and 284 transitions. [2023-11-12 02:14:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:14:23,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-12 02:14:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:23,399 INFO L225 Difference]: With dead ends: 199 [2023-11-12 02:14:23,399 INFO L226 Difference]: Without dead ends: 103 [2023-11-12 02:14:23,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:14:23,402 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 3 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:23,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:14:23,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-12 02:14:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2023-11-12 02:14:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:14:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-11-12 02:14:23,441 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 150 [2023-11-12 02:14:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:23,446 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-11-12 02:14:23,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:14:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-11-12 02:14:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-12 02:14:23,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:23,450 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:23,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:14:23,451 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:14:23,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:23,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1034554107, now seen corresponding path program 1 times [2023-11-12 02:14:23,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:23,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373718635] [2023-11-12 02:14:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:14:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:14:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:14:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:14:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:14:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:23,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:14:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:14:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:14:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:14:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:14:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:14:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:14:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:14:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:14:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:14:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:14:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:14:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:14:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:14:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:14:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:14:24,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:24,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373718635] [2023-11-12 02:14:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373718635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:24,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:24,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:14:24,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208546961] [2023-11-12 02:14:24,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:24,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:14:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:24,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:14:24,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:14:24,118 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:14:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:24,474 INFO L93 Difference]: Finished difference Result 300 states and 427 transitions. [2023-11-12 02:14:24,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:14:24,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-12 02:14:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:24,481 INFO L225 Difference]: With dead ends: 300 [2023-11-12 02:14:24,481 INFO L226 Difference]: Without dead ends: 202 [2023-11-12 02:14:24,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:14:24,493 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 135 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:24,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 435 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:14:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-12 02:14:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 169. [2023-11-12 02:14:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 126 states have internal predecessors, (160), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-12 02:14:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2023-11-12 02:14:24,557 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 150 [2023-11-12 02:14:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:24,560 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2023-11-12 02:14:24,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:14:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2023-11-12 02:14:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:14:24,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:24,570 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:24,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:14:24,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:14:24,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2120166937, now seen corresponding path program 1 times [2023-11-12 02:14:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:24,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470653118] [2023-11-12 02:14:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:24,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:14:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:14:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:14:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:14:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:14:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:14:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:14:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:14:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:28,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:14:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:14:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:14:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:14:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:14:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:14:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:14:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:14:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:14:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:14:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:14:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:14:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:14:29,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:29,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470653118] [2023-11-12 02:14:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470653118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:29,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:29,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-12 02:14:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087990931] [2023-11-12 02:14:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:29,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 02:14:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:29,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 02:14:29,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:14:29,205 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:14:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:31,502 INFO L93 Difference]: Finished difference Result 358 states and 507 transitions. [2023-11-12 02:14:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 02:14:31,502 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2023-11-12 02:14:31,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:14:31,505 INFO L225 Difference]: With dead ends: 358 [2023-11-12 02:14:31,506 INFO L226 Difference]: Without dead ends: 260 [2023-11-12 02:14:31,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2023-11-12 02:14:31,508 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 298 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:14:31,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 841 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-12 02:14:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-12 02:14:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 195. [2023-11-12 02:14:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 152 states have internal predecessors, (197), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-12 02:14:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2023-11-12 02:14:31,580 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 158 [2023-11-12 02:14:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:14:31,582 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2023-11-12 02:14:31,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:14:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2023-11-12 02:14:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-12 02:14:31,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:14:31,587 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:31,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:14:31,587 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:14:31,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash -710246938, now seen corresponding path program 1 times [2023-11-12 02:14:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257454779] [2023-11-12 02:14:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:31,643 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-12 02:14:31,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1584198483] [2023-11-12 02:14:31,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:31,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:31,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:31,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:31,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:14:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:33,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-12 02:14:33,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:34,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:34,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 02:14:36,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:36,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:36,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:36,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-11-12 02:14:37,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:37,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:37,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:37,621 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-11-12 02:14:38,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:38,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:38,933 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-12 02:14:40,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:40,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:40,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:40,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:40,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:40,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2023-11-12 02:14:41,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:41,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:41,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:41,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:41,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:41,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2023-11-12 02:14:42,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:42,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:42,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:42,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:42,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:42,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2023-11-12 02:14:43,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:43,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:43,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:43,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:43,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:43,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2023-11-12 02:14:44,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:44,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:44,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:44,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:44,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:44,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2023-11-12 02:14:45,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:45,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:45,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:45,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:45,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:45,574 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2023-11-12 02:14:46,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,606 INFO L322 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2023-11-12 02:14:46,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 56 [2023-11-12 02:14:46,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2023-11-12 02:14:47,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2023-11-12 02:14:47,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,226 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 55 [2023-11-12 02:14:47,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,558 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 02:14:47,559 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2023-11-12 02:14:48,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:48,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:48,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 36 [2023-11-12 02:14:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 716 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-12 02:14:48,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:48,633 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| c_~var_1_11_Pointer~0.base v_ArrVal_361))) (= (mod (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset) 256) (mod (+ (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset) (select (select .cse0 c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset)) 256)))) is different from false [2023-11-12 02:14:49,031 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_360 (Array Int Int)) (~var_1_16_Pointer~0.offset Int) (v_ArrVal_361 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| c_~var_1_16_Pointer~0.base (store (select |c_#memory_int| c_~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset 24)) c_~var_1_17_Pointer~0.base v_ArrVal_360))) (or (let ((.cse0 (store .cse1 c_~var_1_11_Pointer~0.base v_ArrVal_361))) (= (mod (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset) 256) (mod (+ (select (select .cse0 c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)) 256))) (< (select (select .cse1 c_~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset) (+ (mod (select (select .cse1 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset) 256) 1))))) is different from false [2023-11-12 02:14:49,079 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_360 (Array Int Int)) (~var_1_16_Pointer~0.offset Int) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_357 (Array Int Int))) (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_357))) (store .cse2 c_~var_1_16_Pointer~0.base (store (select .cse2 c_~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset 24))) c_~var_1_17_Pointer~0.base v_ArrVal_360))) (or (let ((.cse0 (store .cse1 c_~var_1_11_Pointer~0.base v_ArrVal_361))) (= (mod (+ (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset) (select (select .cse0 c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset)) 256) (mod (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset) 256))) (< (select (select .cse1 c_~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset) (+ (mod (select (select .cse1 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset) 256) 1))))) is different from false [2023-11-12 02:14:49,129 WARN L854 $PredicateComparison]: unable to prove that (forall ((~var_1_1_Pointer~0.offset Int) (v_ArrVal_360 (Array Int Int)) (~var_1_16_Pointer~0.offset Int) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_357 (Array Int Int))) (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset (+ (mod |c_ULTIMATE.start_step_#t~mem17#1| 256) |c_ULTIMATE.start_step_#t~ite16#1|))) c_~var_1_8_Pointer~0.base v_ArrVal_357))) (store .cse2 c_~var_1_16_Pointer~0.base (store (select .cse2 c_~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset 24))) c_~var_1_17_Pointer~0.base v_ArrVal_360))) (or (let ((.cse0 (store .cse1 c_~var_1_11_Pointer~0.base v_ArrVal_361))) (= (mod (+ (select (select .cse0 c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)) 256) (mod (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) 256))) (< (select (select .cse1 c_~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset) (+ (mod (select (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) 256) 1))))) is different from false [2023-11-12 02:14:49,165 WARN L854 $PredicateComparison]: unable to prove that (forall ((~var_1_1_Pointer~0.offset Int) (v_ArrVal_360 (Array Int Int)) (~var_1_16_Pointer~0.offset Int) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_357 (Array Int Int))) (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset (+ (mod |c_ULTIMATE.start_step_#t~mem17#1| 256) (mod (select (select |c_#memory_int| c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset) 256)))) c_~var_1_8_Pointer~0.base v_ArrVal_357))) (store .cse2 c_~var_1_16_Pointer~0.base (store (select .cse2 c_~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset 24))) c_~var_1_17_Pointer~0.base v_ArrVal_360))) (or (let ((.cse0 (store .cse1 c_~var_1_11_Pointer~0.base v_ArrVal_361))) (= (mod (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) 256) (mod (+ (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset) (select (select .cse0 c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset)) 256))) (< (select (select .cse1 c_~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset) (+ (mod (select (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) 256) 1))))) is different from false [2023-11-12 02:14:49,249 WARN L854 $PredicateComparison]: unable to prove that (forall ((~var_1_1_Pointer~0.offset Int) (v_ArrVal_360 (Array Int Int)) (~var_1_16_Pointer~0.offset Int) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_357 (Array Int Int))) (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset (+ (mod (select (select |c_#memory_int| c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset) 256) (mod (select (select |c_#memory_int| c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset) 256)))) c_~var_1_8_Pointer~0.base v_ArrVal_357))) (store .cse2 c_~var_1_16_Pointer~0.base (store (select .cse2 c_~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset 24))) c_~var_1_17_Pointer~0.base v_ArrVal_360))) (or (let ((.cse0 (store .cse1 c_~var_1_11_Pointer~0.base v_ArrVal_361))) (= (mod (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) 256) (mod (+ (select (select .cse0 c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)) 256))) (< (select (select .cse1 c_~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset) (+ (mod (select (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) 256) 1))))) is different from false [2023-11-12 02:14:49,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:49,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257454779] [2023-11-12 02:14:49,378 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-12 02:14:49,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584198483] [2023-11-12 02:14:49,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584198483] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:49,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:14:49,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2023-11-12 02:14:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352939622] [2023-11-12 02:14:49,379 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:49,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-12 02:14:49,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:49,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-12 02:14:49,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1479, Unknown=29, NotChecked=498, Total=2162 [2023-11-12 02:14:49,383 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 35 states, 33 states have (on average 2.787878787878788) internal successors, (92), 30 states have internal predecessors, (92), 11 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 11 states have call predecessors, (20), 11 states have call successors, (20) [2023-11-12 02:15:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:15:01,087 INFO L93 Difference]: Finished difference Result 511 states and 703 transitions. [2023-11-12 02:15:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-12 02:15:01,088 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.787878787878788) internal successors, (92), 30 states have internal predecessors, (92), 11 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 11 states have call predecessors, (20), 11 states have call successors, (20) Word has length 159 [2023-11-12 02:15:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:15:01,093 INFO L225 Difference]: With dead ends: 511 [2023-11-12 02:15:01,093 INFO L226 Difference]: Without dead ends: 397 [2023-11-12 02:15:01,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=630, Invalid=4476, Unknown=30, NotChecked=870, Total=6006 [2023-11-12 02:15:01,105 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 574 mSDsluCounter, 2092 mSDsCounter, 0 mSdLazyCounter, 3235 mSolverCounterSat, 325 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 3568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 3235 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:15:01,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 2240 Invalid, 3568 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [325 Valid, 3235 Invalid, 8 Unknown, 0 Unchecked, 6.8s Time] [2023-11-12 02:15:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-11-12 02:15:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 206. [2023-11-12 02:15:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 161 states have (on average 1.2919254658385093) internal successors, (208), 161 states have internal predecessors, (208), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-12 02:15:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 288 transitions. [2023-11-12 02:15:01,179 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 288 transitions. Word has length 159 [2023-11-12 02:15:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:15:01,180 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 288 transitions. [2023-11-12 02:15:01,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.787878787878788) internal successors, (92), 30 states have internal predecessors, (92), 11 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 11 states have call predecessors, (20), 11 states have call successors, (20) [2023-11-12 02:15:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 288 transitions. [2023-11-12 02:15:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-12 02:15:01,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:15:01,183 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:01,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:15:01,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:15:01,393 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:15:01,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash -491392220, now seen corresponding path program 1 times [2023-11-12 02:15:01,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:01,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391330642] [2023-11-12 02:15:01,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:01,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:01,433 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-12 02:15:01,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80174368] [2023-11-12 02:15:01,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:01,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:15:01,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:15:01,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:15:01,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983322a5-2d1c-4074-8d5d-01da44204b91/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:15:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:01,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-12 02:15:01,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:15:04,083 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-12 02:15:04,875 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-12 02:15:05,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1