./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU --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 64bit --witnessprinter.graph.data.programhash 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:06:35,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:06:35,460 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-31 22:06:35,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:06:35,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:06:35,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:06:35,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:06:35,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:06:35,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:06:35,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:06:35,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:06:35,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:06:35,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:06:35,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:06:35,510 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:06:35,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:06:35,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:06:35,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:06:35,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:06:35,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:06:35,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:06:35,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:06:35,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:06:35,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:06:35,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:06:35,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:06:35,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:06:35,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:06:35,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:06:35,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:35,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:06:35,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:06:35,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:06:35,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:06:35,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:06:35,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:06:35,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:06:35,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:06:35,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:06:35,524 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_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/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_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 [2024-10-31 22:06:35,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:06:35,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:06:35,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:06:35,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:06:35,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:06:35,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c Unable to find full path for "g++" [2024-10-31 22:06:37,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:06:38,143 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:06:38,144 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-10-31 22:06:38,157 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/data/d7cff05d6/8fba1accfb4f4ce88c83be92a50947ad/FLAG3ed8014f0 [2024-10-31 22:06:38,176 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/data/d7cff05d6/8fba1accfb4f4ce88c83be92a50947ad [2024-10-31 22:06:38,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:06:38,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:06:38,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:38,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:06:38,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:06:38,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486e517f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38, skipping insertion in model container [2024-10-31 22:06:38,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:06:38,441 WARN L251 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_e73eeb55-287c-4235-ba10-9ae64593748a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-10-31 22:06:38,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:38,545 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:06:38,558 WARN L251 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_e73eeb55-287c-4235-ba10-9ae64593748a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-10-31 22:06:38,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:38,637 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:06:38,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38 WrapperNode [2024-10-31 22:06:38,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:38,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:38,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:06:38,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:06:38,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,744 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 308 [2024-10-31 22:06:38,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:38,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:06:38,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:06:38,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:06:38,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,807 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:06:38,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:06:38,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:06:38,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:06:38,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:06:38,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (1/1) ... [2024-10-31 22:06:38,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:38,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:06:38,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:06:38,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:06:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:06:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:06:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:06:38,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:06:39,073 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:06:39,075 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:06:39,749 INFO L? ?]: Removed 175 outVars from TransFormulas that were not future-live. [2024-10-31 22:06:39,749 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:06:39,763 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:06:39,763 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:06:39,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:39 BoogieIcfgContainer [2024-10-31 22:06:39,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:06:39,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:06:39,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:06:39,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:06:39,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:06:38" (1/3) ... [2024-10-31 22:06:39,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3660f521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:39, skipping insertion in model container [2024-10-31 22:06:39,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:38" (2/3) ... [2024-10-31 22:06:39,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3660f521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:39, skipping insertion in model container [2024-10-31 22:06:39,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:39" (3/3) ... [2024-10-31 22:06:39,775 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_segments.c [2024-10-31 22:06:39,790 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:06:39,790 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:06:39,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:06:39,871 INFO L333 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, 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;@1c4a9ab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:06:39,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:06:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-31 22:06:39,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:39,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:39,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:39,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:39,896 INFO L85 PathProgramCache]: Analyzing trace with hash 365214336, now seen corresponding path program 1 times [2024-10-31 22:06:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:39,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695035595] [2024-10-31 22:06:39,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:39,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:40,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:40,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695035595] [2024-10-31 22:06:40,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695035595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:40,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:40,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:06:40,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110943625] [2024-10-31 22:06:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:40,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:06:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:40,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:06:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:06:40,861 INFO L87 Difference]: Start difference. First operand has 82 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:40,929 INFO L93 Difference]: Finished difference Result 157 states and 231 transitions. [2024-10-31 22:06:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:06:40,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-31 22:06:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:40,942 INFO L225 Difference]: With dead ends: 157 [2024-10-31 22:06:40,942 INFO L226 Difference]: Without dead ends: 81 [2024-10-31 22:06:40,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:06:40,950 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:40,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:06:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-31 22:06:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-31 22:06:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-10-31 22:06:41,001 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 31 [2024-10-31 22:06:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:41,002 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-10-31 22:06:41,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-10-31 22:06:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:06:41,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:41,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:41,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:06:41,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:41,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:41,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1561562150, now seen corresponding path program 1 times [2024-10-31 22:06:41,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:41,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975293766] [2024-10-31 22:06:41,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:41,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:41,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975293766] [2024-10-31 22:06:41,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975293766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:41,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:41,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:06:41,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939077900] [2024-10-31 22:06:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:41,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:06:41,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:41,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:06:41,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:06:41,258 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:41,337 INFO L93 Difference]: Finished difference Result 158 states and 229 transitions. [2024-10-31 22:06:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:06:41,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-31 22:06:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:41,341 INFO L225 Difference]: With dead ends: 158 [2024-10-31 22:06:41,341 INFO L226 Difference]: Without dead ends: 83 [2024-10-31 22:06:41,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:06:41,346 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:41,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:06:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-31 22:06:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-31 22:06:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2024-10-31 22:06:41,360 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 32 [2024-10-31 22:06:41,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:41,361 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2024-10-31 22:06:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2024-10-31 22:06:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-31 22:06:41,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:41,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:41,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:06:41,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:41,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2033215129, now seen corresponding path program 1 times [2024-10-31 22:06:41,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:41,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193455990] [2024-10-31 22:06:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:41,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:41,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:41,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193455990] [2024-10-31 22:06:41,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193455990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:41,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:41,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:06:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900256774] [2024-10-31 22:06:41,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:41,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:06:41,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:41,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:06:41,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:06:41,980 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:42,085 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2024-10-31 22:06:42,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:06:42,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-31 22:06:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:42,087 INFO L225 Difference]: With dead ends: 164 [2024-10-31 22:06:42,087 INFO L226 Difference]: Without dead ends: 87 [2024-10-31 22:06:42,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:42,089 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 98 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:42,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 415 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:06:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-31 22:06:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-10-31 22:06:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-10-31 22:06:42,100 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 33 [2024-10-31 22:06:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:42,100 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-10-31 22:06:42,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-10-31 22:06:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 22:06:42,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:42,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:42,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:06:42,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:42,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:42,104 INFO L85 PathProgramCache]: Analyzing trace with hash 169704829, now seen corresponding path program 1 times [2024-10-31 22:06:42,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:42,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489004377] [2024-10-31 22:06:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:42,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:43,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:43,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489004377] [2024-10-31 22:06:43,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489004377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:43,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:43,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:06:43,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214748696] [2024-10-31 22:06:43,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:43,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:06:43,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:06:43,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:43,111 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:43,300 INFO L93 Difference]: Finished difference Result 174 states and 248 transitions. [2024-10-31 22:06:43,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:06:43,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-31 22:06:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:43,302 INFO L225 Difference]: With dead ends: 174 [2024-10-31 22:06:43,303 INFO L226 Difference]: Without dead ends: 94 [2024-10-31 22:06:43,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:06:43,304 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 122 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:43,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 535 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:06:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-31 22:06:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-10-31 22:06:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-10-31 22:06:43,312 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 34 [2024-10-31 22:06:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:43,313 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-10-31 22:06:43,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-10-31 22:06:43,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-31 22:06:43,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:43,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:43,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:06:43,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:43,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash -301874261, now seen corresponding path program 1 times [2024-10-31 22:06:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:43,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624701602] [2024-10-31 22:06:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:44,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:44,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624701602] [2024-10-31 22:06:44,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624701602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:44,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:44,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:06:44,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828331456] [2024-10-31 22:06:44,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:44,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:06:44,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:44,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:06:44,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:06:44,190 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:44,338 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-10-31 22:06:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:06:44,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-31 22:06:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:44,341 INFO L225 Difference]: With dead ends: 184 [2024-10-31 22:06:44,342 INFO L226 Difference]: Without dead ends: 99 [2024-10-31 22:06:44,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:06:44,346 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 114 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:44,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 812 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:06:44,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-31 22:06:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-10-31 22:06:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-10-31 22:06:44,360 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 35 [2024-10-31 22:06:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:44,361 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-10-31 22:06:44,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-10-31 22:06:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-31 22:06:44,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:44,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:44,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:06:44,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:44,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash -37543868, now seen corresponding path program 1 times [2024-10-31 22:06:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648352873] [2024-10-31 22:06:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:44,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:44,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648352873] [2024-10-31 22:06:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648352873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:44,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:44,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:06:44,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610186863] [2024-10-31 22:06:44,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:44,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:44,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:44,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:44,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:44,542 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:44,611 INFO L93 Difference]: Finished difference Result 270 states and 377 transitions. [2024-10-31 22:06:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:06:44,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-31 22:06:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:44,613 INFO L225 Difference]: With dead ends: 270 [2024-10-31 22:06:44,613 INFO L226 Difference]: Without dead ends: 180 [2024-10-31 22:06:44,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:44,616 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 301 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:44,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:06:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-31 22:06:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2024-10-31 22:06:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 107 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2024-10-31 22:06:44,632 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 35 [2024-10-31 22:06:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:44,632 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2024-10-31 22:06:44,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2024-10-31 22:06:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-31 22:06:44,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:44,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:44,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:06:44,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:44,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash 580893341, now seen corresponding path program 1 times [2024-10-31 22:06:44,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:44,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928783980] [2024-10-31 22:06:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:44,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:44,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928783980] [2024-10-31 22:06:44,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928783980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:44,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:44,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:06:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495029867] [2024-10-31 22:06:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:44,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:44,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:44,819 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:44,900 INFO L93 Difference]: Finished difference Result 264 states and 366 transitions. [2024-10-31 22:06:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:06:44,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-31 22:06:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:44,902 INFO L225 Difference]: With dead ends: 264 [2024-10-31 22:06:44,902 INFO L226 Difference]: Without dead ends: 170 [2024-10-31 22:06:44,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:44,903 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 289 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:44,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:06:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-31 22:06:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 104. [2024-10-31 22:06:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2024-10-31 22:06:44,915 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 35 [2024-10-31 22:06:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:44,915 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2024-10-31 22:06:44,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2024-10-31 22:06:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-31 22:06:44,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:44,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:44,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:06:44,917 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:44,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1650261173, now seen corresponding path program 1 times [2024-10-31 22:06:44,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:44,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534614305] [2024-10-31 22:06:44,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:45,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:45,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534614305] [2024-10-31 22:06:45,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534614305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:45,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:45,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:06:45,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570446734] [2024-10-31 22:06:45,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:45,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:06:45,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:45,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:06:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:06:45,567 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:45,746 INFO L93 Difference]: Finished difference Result 209 states and 292 transitions. [2024-10-31 22:06:45,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:06:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-31 22:06:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:45,747 INFO L225 Difference]: With dead ends: 209 [2024-10-31 22:06:45,748 INFO L226 Difference]: Without dead ends: 119 [2024-10-31 22:06:45,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:06:45,749 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 121 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:45,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 783 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:06:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-31 22:06:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2024-10-31 22:06:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 112 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-10-31 22:06:45,764 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 36 [2024-10-31 22:06:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:45,764 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-10-31 22:06:45,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-10-31 22:06:45,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-31 22:06:45,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:45,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:45,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:06:45,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:45,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:45,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1263227207, now seen corresponding path program 1 times [2024-10-31 22:06:45,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:45,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442411824] [2024-10-31 22:06:45,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:45,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:46,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:46,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442411824] [2024-10-31 22:06:46,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442411824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:46,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:46,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-31 22:06:46,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732320024] [2024-10-31 22:06:46,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:46,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-31 22:06:46,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:46,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-31 22:06:46,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:06:46,536 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:46,832 INFO L93 Difference]: Finished difference Result 226 states and 316 transitions. [2024-10-31 22:06:46,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:06:46,832 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-31 22:06:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:46,834 INFO L225 Difference]: With dead ends: 226 [2024-10-31 22:06:46,834 INFO L226 Difference]: Without dead ends: 127 [2024-10-31 22:06:46,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:06:46,836 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 126 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:46,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1111 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:06:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-31 22:06:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-10-31 22:06:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.4) internal successors, (168), 120 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 168 transitions. [2024-10-31 22:06:46,842 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 168 transitions. Word has length 37 [2024-10-31 22:06:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:46,843 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 168 transitions. [2024-10-31 22:06:46,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 168 transitions. [2024-10-31 22:06:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-31 22:06:46,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:46,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:46,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:06:46,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:46,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1918885507, now seen corresponding path program 1 times [2024-10-31 22:06:46,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:46,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357616703] [2024-10-31 22:06:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:47,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357616703] [2024-10-31 22:06:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357616703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:47,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:47,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-31 22:06:47,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625717401] [2024-10-31 22:06:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:47,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-31 22:06:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:47,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-31 22:06:47,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:06:47,559 INFO L87 Difference]: Start difference. First operand 121 states and 168 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:47,919 INFO L93 Difference]: Finished difference Result 253 states and 353 transitions. [2024-10-31 22:06:47,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 22:06:47,920 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-31 22:06:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:47,921 INFO L225 Difference]: With dead ends: 253 [2024-10-31 22:06:47,921 INFO L226 Difference]: Without dead ends: 146 [2024-10-31 22:06:47,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:06:47,922 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 135 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:47,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1235 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:06:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-31 22:06:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2024-10-31 22:06:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2024-10-31 22:06:47,928 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 37 [2024-10-31 22:06:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:47,928 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2024-10-31 22:06:47,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2024-10-31 22:06:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-31 22:06:47,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:47,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:47,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:06:47,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1515202326, now seen corresponding path program 1 times [2024-10-31 22:06:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767712864] [2024-10-31 22:06:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:48,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:48,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767712864] [2024-10-31 22:06:48,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767712864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:48,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:48,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:06:48,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159392794] [2024-10-31 22:06:48,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:48,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:48,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:48,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:48,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:48,076 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:48,145 INFO L93 Difference]: Finished difference Result 350 states and 487 transitions. [2024-10-31 22:06:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:06:48,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-31 22:06:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:48,147 INFO L225 Difference]: With dead ends: 350 [2024-10-31 22:06:48,147 INFO L226 Difference]: Without dead ends: 225 [2024-10-31 22:06:48,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:48,148 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 269 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:48,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:06:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-31 22:06:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 159. [2024-10-31 22:06:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.379746835443038) internal successors, (218), 158 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 218 transitions. [2024-10-31 22:06:48,154 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 218 transitions. Word has length 37 [2024-10-31 22:06:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:48,154 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 218 transitions. [2024-10-31 22:06:48,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 218 transitions. [2024-10-31 22:06:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-31 22:06:48,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:48,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:48,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:06:48,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:48,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1136610428, now seen corresponding path program 1 times [2024-10-31 22:06:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:48,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289457646] [2024-10-31 22:06:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:48,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:48,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289457646] [2024-10-31 22:06:48,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289457646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:48,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:48,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:06:48,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954171729] [2024-10-31 22:06:48,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:48,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:48,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:48,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:48,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:48,324 INFO L87 Difference]: Start difference. First operand 159 states and 218 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:48,385 INFO L93 Difference]: Finished difference Result 343 states and 474 transitions. [2024-10-31 22:06:48,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:06:48,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-31 22:06:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:48,387 INFO L225 Difference]: With dead ends: 343 [2024-10-31 22:06:48,387 INFO L226 Difference]: Without dead ends: 206 [2024-10-31 22:06:48,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:48,388 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 258 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:48,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:06:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-31 22:06:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 149. [2024-10-31 22:06:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.3783783783783783) internal successors, (204), 148 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 204 transitions. [2024-10-31 22:06:48,393 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 204 transitions. Word has length 37 [2024-10-31 22:06:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:48,393 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 204 transitions. [2024-10-31 22:06:48,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 204 transitions. [2024-10-31 22:06:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-31 22:06:48,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:48,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:48,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:06:48,395 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1881024206, now seen corresponding path program 1 times [2024-10-31 22:06:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715415214] [2024-10-31 22:06:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:48,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715415214] [2024-10-31 22:06:48,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715415214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:48,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:48,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:06:48,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023407693] [2024-10-31 22:06:48,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:48,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:48,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:48,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:48,535 INFO L87 Difference]: Start difference. First operand 149 states and 204 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:48,602 INFO L93 Difference]: Finished difference Result 325 states and 449 transitions. [2024-10-31 22:06:48,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:06:48,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-31 22:06:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:48,604 INFO L225 Difference]: With dead ends: 325 [2024-10-31 22:06:48,604 INFO L226 Difference]: Without dead ends: 200 [2024-10-31 22:06:48,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:48,606 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 240 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:48,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:06:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-31 22:06:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 157. [2024-10-31 22:06:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3653846153846154) internal successors, (213), 156 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 213 transitions. [2024-10-31 22:06:48,612 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 213 transitions. Word has length 38 [2024-10-31 22:06:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:48,612 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 213 transitions. [2024-10-31 22:06:48,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 213 transitions. [2024-10-31 22:06:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-31 22:06:48,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:48,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:48,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:06:48,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:48,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:48,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2086330599, now seen corresponding path program 1 times [2024-10-31 22:06:48,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:48,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040909135] [2024-10-31 22:06:48,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:06:48,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:06:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:06:48,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:06:48,722 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:06:48,723 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:06:48,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:06:48,729 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:48,782 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:06:48,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:06:48 BoogieIcfgContainer [2024-10-31 22:06:48,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:06:48,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:06:48,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:06:48,787 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:06:48,788 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:39" (3/4) ... [2024-10-31 22:06:48,791 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:06:48,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:06:48,793 INFO L158 Benchmark]: Toolchain (without parser) took 10612.44ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 135.3MB in the beginning and 90.4MB in the end (delta: 44.9MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2024-10-31 22:06:48,793 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory was 90.3MB in the beginning and 90.3MB in the end (delta: 25.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:06:48,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.62ms. Allocated memory is still 172.0MB. Free memory was 135.3MB in the beginning and 118.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:06:48,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.48ms. Allocated memory is still 172.0MB. Free memory was 118.5MB in the beginning and 110.8MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:06:48,795 INFO L158 Benchmark]: Boogie Preprocessor took 134.28ms. Allocated memory is still 172.0MB. Free memory was 110.8MB in the beginning and 105.9MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:06:48,795 INFO L158 Benchmark]: RCFGBuilder took 883.58ms. Allocated memory is still 172.0MB. Free memory was 105.9MB in the beginning and 131.6MB in the end (delta: -25.7MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2024-10-31 22:06:48,796 INFO L158 Benchmark]: TraceAbstraction took 9020.14ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 130.7MB in the beginning and 90.4MB in the end (delta: 40.3MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2024-10-31 22:06:48,796 INFO L158 Benchmark]: Witness Printer took 5.10ms. Allocated memory is still 213.9MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:06:48,798 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory was 90.3MB in the beginning and 90.3MB in the end (delta: 25.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.62ms. Allocated memory is still 172.0MB. Free memory was 135.3MB in the beginning and 118.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.48ms. Allocated memory is still 172.0MB. Free memory was 118.5MB in the beginning and 110.8MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.28ms. Allocated memory is still 172.0MB. Free memory was 110.8MB in the beginning and 105.9MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 883.58ms. Allocated memory is still 172.0MB. Free memory was 105.9MB in the beginning and 131.6MB in the end (delta: -25.7MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9020.14ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 130.7MB in the beginning and 90.4MB in the end (delta: 40.3MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. * Witness Printer took 5.10ms. Allocated memory is still 213.9MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 113. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_52 mask_SORT_52 = (SORT_52)-1 >> (sizeof(SORT_52) * 8 - 2); [L36] const SORT_52 msb_SORT_52 = (SORT_52)1 << (2 - 1); [L38] const SORT_54 mask_SORT_54 = (SORT_54)-1 >> (sizeof(SORT_54) * 8 - 3); [L39] const SORT_54 msb_SORT_54 = (SORT_54)1 << (3 - 1); [L41] const SORT_4 var_5 = 0; [L42] const SORT_8 var_10 = 0; [L43] const SORT_8 var_13 = 1; [L44] const SORT_8 var_17 = 2; [L45] const SORT_8 var_21 = 3; [L46] const SORT_8 var_25 = 4; [L47] const SORT_1 var_30 = 1; [L48] const SORT_4 var_41 = 1; [L49] const SORT_4 var_44 = 4; [L50] const SORT_4 var_45 = 3; [L51] const SORT_4 var_50 = 2; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L56] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L58] SORT_4 init_7_arg_1 = var_5; [L59] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L62] input_2 = __VERIFIER_nondet_uchar() [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L64] input_3 = input_3 & mask_SORT_1 [L67] SORT_4 var_9_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9_arg_0=0] [L68] EXPR var_9_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L68] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L69] SORT_8 var_9 = var_9_arg_0; [L70] SORT_8 var_11_arg_0 = var_9; [L71] SORT_8 var_11_arg_1 = var_10; [L72] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L73] SORT_4 var_12_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_11=1, var_12_arg_0=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L74] EXPR var_12_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_11=1, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L74] var_12_arg_0 = var_12_arg_0 & mask_SORT_4 [L75] SORT_8 var_12 = var_12_arg_0; [L76] SORT_8 var_14_arg_0 = var_12; [L77] SORT_8 var_14_arg_1 = var_13; [L78] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L79] SORT_1 var_15_arg_0 = var_11; [L80] SORT_1 var_15_arg_1 = var_14; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15_arg_0=1, var_15_arg_1=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L81] EXPR var_15_arg_0 | var_15_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L81] SORT_1 var_15 = var_15_arg_0 | var_15_arg_1; [L82] SORT_4 var_16_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15=1, var_16_arg_0=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L83] EXPR var_16_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L83] var_16_arg_0 = var_16_arg_0 & mask_SORT_4 [L84] SORT_8 var_16 = var_16_arg_0; [L85] SORT_8 var_18_arg_0 = var_16; [L86] SORT_8 var_18_arg_1 = var_17; [L87] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L88] SORT_1 var_19_arg_0 = var_15; [L89] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19_arg_0=1, var_19_arg_1=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L90] EXPR var_19_arg_0 | var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L90] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L91] SORT_4 var_20_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19=1, var_20_arg_0=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L92] EXPR var_20_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19=1, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L92] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L93] SORT_8 var_20 = var_20_arg_0; [L94] SORT_8 var_22_arg_0 = var_20; [L95] SORT_8 var_22_arg_1 = var_21; [L96] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L97] SORT_1 var_23_arg_0 = var_19; [L98] SORT_1 var_23_arg_1 = var_22; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23_arg_0=1, var_23_arg_1=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L99] EXPR var_23_arg_0 | var_23_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L99] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L100] SORT_4 var_24_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23=1, var_24_arg_0=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L101] EXPR var_24_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23=1, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L101] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L102] SORT_8 var_24 = var_24_arg_0; [L103] SORT_8 var_26_arg_0 = var_24; [L104] SORT_8 var_26_arg_1 = var_25; [L105] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L106] SORT_1 var_27_arg_0 = var_23; [L107] SORT_1 var_27_arg_1 = var_26; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L108] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_1 var_31_arg_0 = var_27; [L110] SORT_1 var_31 = ~var_31_arg_0; [L111] SORT_1 var_32_arg_0 = var_30; [L112] SORT_1 var_32_arg_1 = var_31; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_32_arg_0=1, var_32_arg_1=-2, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L113] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L114] var_32 = var_32 & mask_SORT_1 [L115] SORT_1 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2073 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2073 mSDsluCounter, 7113 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5750 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1181 IncrementalHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1363 mSDtfsCounter, 1181 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=11, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 330 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 1385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:06:48,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU --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 64bit --witnessprinter.graph.data.programhash 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:06:51,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:06:51,476 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-31 22:06:51,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:06:51,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:06:51,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:06:51,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:06:51,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:06:51,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:06:51,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:06:51,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:06:51,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:06:51,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:06:51,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:06:51,532 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:06:51,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:06:51,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:06:51,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:06:51,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:06:51,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:06:51,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:06:51,541 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:06:51,542 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:06:51,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:06:51,542 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:06:51,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:06:51,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:06:51,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:06:51,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:06:51,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:06:51,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:06:51,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:51,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:06:51,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:06:51,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:06:51,548 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:06:51,548 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:06:51,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:06:51,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:06:51,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:06:51,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:06:51,551 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:06:51,551 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_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/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_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 [2024-10-31 22:06:51,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:06:51,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:06:51,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:06:51,980 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:06:51,980 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:06:51,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c Unable to find full path for "g++" [2024-10-31 22:06:54,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:06:54,444 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:06:54,445 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-10-31 22:06:54,458 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/data/a465fdee5/f8d084e37f32489685ac9f04d19b38c7/FLAGa359f5ae1 [2024-10-31 22:06:54,476 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/data/a465fdee5/f8d084e37f32489685ac9f04d19b38c7 [2024-10-31 22:06:54,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:06:54,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:06:54,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:54,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:06:54,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:06:54,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:54" (1/1) ... [2024-10-31 22:06:54,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503c0bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:54, skipping insertion in model container [2024-10-31 22:06:54,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:54" (1/1) ... [2024-10-31 22:06:54,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:06:54,774 WARN L251 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_e73eeb55-287c-4235-ba10-9ae64593748a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-10-31 22:06:54,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:54,917 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:06:54,932 WARN L251 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_e73eeb55-287c-4235-ba10-9ae64593748a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-10-31 22:06:54,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:55,022 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:06:55,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55 WrapperNode [2024-10-31 22:06:55,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:55,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:55,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:06:55,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:06:55,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,096 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 164 [2024-10-31 22:06:55,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:55,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:06:55,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:06:55,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:06:55,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,143 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:06:55,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:06:55,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:06:55,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:06:55,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:06:55,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (1/1) ... [2024-10-31 22:06:55,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:55,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:06:55,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:06:55,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:06:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:06:55,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:06:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:06:55,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:06:55,517 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:06:55,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:06:55,917 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-10-31 22:06:55,920 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:06:55,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:06:55,938 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:06:55,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:55 BoogieIcfgContainer [2024-10-31 22:06:55,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:06:55,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:06:55,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:06:55,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:06:55,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:06:54" (1/3) ... [2024-10-31 22:06:55,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43482466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:55, skipping insertion in model container [2024-10-31 22:06:55,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:55" (2/3) ... [2024-10-31 22:06:55,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43482466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:55, skipping insertion in model container [2024-10-31 22:06:55,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:55" (3/3) ... [2024-10-31 22:06:55,952 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_segments.c [2024-10-31 22:06:55,972 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:06:55,973 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:06:56,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:06:56,061 INFO L333 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, 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;@2d3b1a8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:06:56,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:06:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:06:56,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:56,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:06:56,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:56,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:56,085 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-10-31 22:06:56,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:06:56,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932232721] [2024-10-31 22:06:56,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:56,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:06:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:06:56,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:06:56,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:06:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:56,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-31 22:06:56,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:06:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:56,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:06:56,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:06:56,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932232721] [2024-10-31 22:06:56,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932232721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:56,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:56,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:06:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592721994] [2024-10-31 22:06:56,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:56,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:06:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:06:56,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:06:56,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:06:56,693 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:56,767 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-10-31 22:06:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:06:56,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-31 22:06:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:56,780 INFO L225 Difference]: With dead ends: 18 [2024-10-31 22:06:56,781 INFO L226 Difference]: Without dead ends: 10 [2024-10-31 22:06:56,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:56,788 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:56,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:06:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-31 22:06:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-10-31 22:06:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-10-31 22:06:56,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-10-31 22:06:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:56,826 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-10-31 22:06:56,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-10-31 22:06:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 22:06:56,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:56,827 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:56,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-31 22:06:57,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:06:57,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:57,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-10-31 22:06:57,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:06:57,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653172] [2024-10-31 22:06:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:57,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:06:57,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:06:57,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:06:57,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73eeb55-287c-4235-ba10-9ae64593748a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-31 22:06:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:57,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-31 22:06:57,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:06:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:58,167 INFO L311 TraceCheckSpWp]: Computing backward predicates...