./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5e750e5fa316e30fef8e3158d304f9d418ce308f7b74e89da459ba726747abe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:28:44,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:28:44,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:28:44,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:28:44,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:28:44,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:28:44,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:28:44,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:28:44,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:28:44,985 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:28:44,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:28:44,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:28:44,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:28:44,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:28:44,986 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:28:44,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:28:44,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:28:44,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:28:44,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:28:44,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:28:44,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:28:44,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:28:44,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:28:44,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:28:44,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:28:44,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:28:44,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:28:44,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:28:44,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:28:44,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:28:44,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:28:44,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:28:44,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:28:44,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:28:44,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:28:45,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:28:45,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:28:45,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:28:45,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:28:45,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:28:45,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:28:45,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:28:45,002 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5e750e5fa316e30fef8e3158d304f9d418ce308f7b74e89da459ba726747abe [2024-10-13 06:28:45,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:28:45,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:28:45,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:28:45,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:28:45,262 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:28:45,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i [2024-10-13 06:28:46,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:28:46,916 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:28:46,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i [2024-10-13 06:28:46,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7556759d5/a49745bdef1b4868a23c50699316ca84/FLAG40d2f9353 [2024-10-13 06:28:46,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7556759d5/a49745bdef1b4868a23c50699316ca84 [2024-10-13 06:28:46,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:28:46,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:28:46,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:28:46,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:28:46,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:28:46,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:28:46" (1/1) ... [2024-10-13 06:28:46,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0c7bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:46, skipping insertion in model container [2024-10-13 06:28:46,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:28:46" (1/1) ... [2024-10-13 06:28:46,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:28:47,146 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i[916,929] [2024-10-13 06:28:47,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:28:47,246 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:28:47,255 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i[916,929] [2024-10-13 06:28:47,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:28:47,320 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:28:47,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47 WrapperNode [2024-10-13 06:28:47,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:28:47,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:28:47,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:28:47,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:28:47,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,395 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 483 [2024-10-13 06:28:47,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:28:47,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:28:47,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:28:47,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:28:47,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,436 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 17 writes are split as follows [0, 17]. [2024-10-13 06:28:47,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:28:47,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:28:47,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:28:47,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:28:47,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (1/1) ... [2024-10-13 06:28:47,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:28:47,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:28:47,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:28:47,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:28:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:28:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:28:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:28:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:28:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:28:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:28:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:28:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:28:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:28:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:28:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:28:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:28:47,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:28:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:28:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:28:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:28:47,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:28:47,711 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:28:47,713 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:28:48,255 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-13 06:28:48,255 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:28:48,299 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:28:48,299 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:28:48,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:28:48 BoogieIcfgContainer [2024-10-13 06:28:48,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:28:48,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:28:48,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:28:48,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:28:48,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:28:46" (1/3) ... [2024-10-13 06:28:48,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a79d221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:28:48, skipping insertion in model container [2024-10-13 06:28:48,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:28:47" (2/3) ... [2024-10-13 06:28:48,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a79d221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:28:48, skipping insertion in model container [2024-10-13 06:28:48,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:28:48" (3/3) ... [2024-10-13 06:28:48,310 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-44.i [2024-10-13 06:28:48,323 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:28:48,324 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:28:48,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:28:48,400 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;@622c81d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:28:48,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:28:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:28:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:28:48,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:48,422 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:48,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash -428167194, now seen corresponding path program 1 times [2024-10-13 06:28:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993987211] [2024-10-13 06:28:48,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:48,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:48,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993987211] [2024-10-13 06:28:48,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993987211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:48,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:48,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:28:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118739366] [2024-10-13 06:28:48,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:48,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:28:48,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:48,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:28:48,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:28:48,887 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:28:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:28:48,980 INFO L93 Difference]: Finished difference Result 219 states and 349 transitions. [2024-10-13 06:28:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:28:48,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2024-10-13 06:28:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:28:48,996 INFO L225 Difference]: With dead ends: 219 [2024-10-13 06:28:48,996 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 06:28:49,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:28:49,008 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:28:49,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:28:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 06:28:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-13 06:28:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:28:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-10-13 06:28:49,063 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 154 [2024-10-13 06:28:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:28:49,063 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-10-13 06:28:49,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:28:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-10-13 06:28:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:28:49,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:49,071 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:49,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:28:49,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:49,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:49,073 INFO L85 PathProgramCache]: Analyzing trace with hash -686195368, now seen corresponding path program 1 times [2024-10-13 06:28:49,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:49,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886220914] [2024-10-13 06:28:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:49,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:49,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:49,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886220914] [2024-10-13 06:28:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886220914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:49,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:49,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:28:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357248610] [2024-10-13 06:28:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:49,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:28:49,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:49,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:28:49,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:28:49,474 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:28:49,530 INFO L93 Difference]: Finished difference Result 220 states and 323 transitions. [2024-10-13 06:28:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:28:49,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-13 06:28:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:28:49,534 INFO L225 Difference]: With dead ends: 220 [2024-10-13 06:28:49,534 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 06:28:49,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-13 06:28:49,536 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:28:49,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:28:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 06:28:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-13 06:28:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 88 states have internal predecessors, (120), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:28:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2024-10-13 06:28:49,553 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 154 [2024-10-13 06:28:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:28:49,555 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2024-10-13 06:28:49,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2024-10-13 06:28:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:28:49,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:49,559 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:49,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:28:49,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:49,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:49,561 INFO L85 PathProgramCache]: Analyzing trace with hash -686135786, now seen corresponding path program 1 times [2024-10-13 06:28:49,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:49,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978150484] [2024-10-13 06:28:49,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:49,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:50,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978150484] [2024-10-13 06:28:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978150484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:50,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:28:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596631472] [2024-10-13 06:28:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:50,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:28:50,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:50,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:28:50,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:28:50,285 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:28:50,536 INFO L93 Difference]: Finished difference Result 273 states and 398 transitions. [2024-10-13 06:28:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:28:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-13 06:28:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:28:50,538 INFO L225 Difference]: With dead ends: 273 [2024-10-13 06:28:50,538 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 06:28:50,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:28:50,540 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 61 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:28:50,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 521 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:28:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 06:28:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 129. [2024-10-13 06:28:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:28:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2024-10-13 06:28:50,559 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 154 [2024-10-13 06:28:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:28:50,560 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2024-10-13 06:28:50,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2024-10-13 06:28:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:28:50,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:50,565 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:50,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:28:50,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:50,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash -822359312, now seen corresponding path program 1 times [2024-10-13 06:28:50,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:50,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871411714] [2024-10-13 06:28:50,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:50,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:52,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871411714] [2024-10-13 06:28:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871411714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:52,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:28:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707434312] [2024-10-13 06:28:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:28:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:52,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:28:52,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:28:52,714 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:28:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:28:53,198 INFO L93 Difference]: Finished difference Result 299 states and 433 transitions. [2024-10-13 06:28:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:28:53,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 155 [2024-10-13 06:28:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:28:53,202 INFO L225 Difference]: With dead ends: 299 [2024-10-13 06:28:53,202 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 06:28:53,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:28:53,203 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 68 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:28:53,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 943 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:28:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 06:28:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-10-13 06:28:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 142 states have (on average 1.380281690140845) internal successors, (196), 143 states have internal predecessors, (196), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 06:28:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 242 transitions. [2024-10-13 06:28:53,226 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 242 transitions. Word has length 155 [2024-10-13 06:28:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:28:53,227 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 242 transitions. [2024-10-13 06:28:53,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:28:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 242 transitions. [2024-10-13 06:28:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 06:28:53,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:53,231 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:53,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:28:53,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:53,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:53,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1970485227, now seen corresponding path program 1 times [2024-10-13 06:28:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:53,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365452014] [2024-10-13 06:28:53,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:53,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:53,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:53,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365452014] [2024-10-13 06:28:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365452014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:53,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:53,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:28:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152652609] [2024-10-13 06:28:53,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:53,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:28:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:53,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:28:53,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:28:53,458 INFO L87 Difference]: Start difference. First operand 168 states and 242 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:28:53,504 INFO L93 Difference]: Finished difference Result 341 states and 491 transitions. [2024-10-13 06:28:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:28:53,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 156 [2024-10-13 06:28:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:28:53,513 INFO L225 Difference]: With dead ends: 341 [2024-10-13 06:28:53,514 INFO L226 Difference]: Without dead ends: 174 [2024-10-13 06:28:53,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:28:53,517 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:28:53,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:28:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-13 06:28:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-10-13 06:28:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 148 states have (on average 1.364864864864865) internal successors, (202), 149 states have internal predecessors, (202), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 06:28:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 248 transitions. [2024-10-13 06:28:53,535 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 248 transitions. Word has length 156 [2024-10-13 06:28:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:28:53,536 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 248 transitions. [2024-10-13 06:28:53,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 248 transitions. [2024-10-13 06:28:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 06:28:53,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:53,538 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:53,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:28:53,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:53,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash 927107390, now seen corresponding path program 1 times [2024-10-13 06:28:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:53,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344314558] [2024-10-13 06:28:53,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:53,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:55,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:55,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344314558] [2024-10-13 06:28:55,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344314558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:55,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:55,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:28:55,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891388364] [2024-10-13 06:28:55,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:55,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:28:55,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:55,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:28:55,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:28:55,161 INFO L87 Difference]: Start difference. First operand 174 states and 248 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:28:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:28:55,517 INFO L93 Difference]: Finished difference Result 348 states and 491 transitions. [2024-10-13 06:28:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:28:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 158 [2024-10-13 06:28:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:28:55,521 INFO L225 Difference]: With dead ends: 348 [2024-10-13 06:28:55,521 INFO L226 Difference]: Without dead ends: 175 [2024-10-13 06:28:55,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:28:55,523 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 60 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:28:55,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 573 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:28:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-13 06:28:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 136. [2024-10-13 06:28:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:28:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 193 transitions. [2024-10-13 06:28:55,539 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 193 transitions. Word has length 158 [2024-10-13 06:28:55,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:28:55,540 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 193 transitions. [2024-10-13 06:28:55,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:28:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 193 transitions. [2024-10-13 06:28:55,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 06:28:55,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:55,541 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:55,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:28:55,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:55,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash 206989158, now seen corresponding path program 1 times [2024-10-13 06:28:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:55,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075440999] [2024-10-13 06:28:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075440999] [2024-10-13 06:28:55,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075440999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:55,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:55,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:28:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010792980] [2024-10-13 06:28:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:55,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:28:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:55,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:28:55,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:28:55,672 INFO L87 Difference]: Start difference. First operand 136 states and 193 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:28:55,690 INFO L93 Difference]: Finished difference Result 271 states and 385 transitions. [2024-10-13 06:28:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:28:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 158 [2024-10-13 06:28:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:28:55,696 INFO L225 Difference]: With dead ends: 271 [2024-10-13 06:28:55,696 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 06:28:55,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:28:55,698 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 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-13 06:28:55,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:28:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 06:28:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-13 06:28:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 112 states have internal predecessors, (150), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:28:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2024-10-13 06:28:55,706 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 158 [2024-10-13 06:28:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:28:55,707 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2024-10-13 06:28:55,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2024-10-13 06:28:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 06:28:55,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:55,709 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:55,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:28:55,710 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:55,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -472780520, now seen corresponding path program 1 times [2024-10-13 06:28:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:55,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574745055] [2024-10-13 06:28:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:56,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574745055] [2024-10-13 06:28:56,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574745055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:56,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:56,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:28:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765320598] [2024-10-13 06:28:56,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:56,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:28:56,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:56,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:28:56,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:28:56,796 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:28:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:28:57,076 INFO L93 Difference]: Finished difference Result 345 states and 487 transitions. [2024-10-13 06:28:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:28:57,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-10-13 06:28:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:28:57,078 INFO L225 Difference]: With dead ends: 345 [2024-10-13 06:28:57,079 INFO L226 Difference]: Without dead ends: 210 [2024-10-13 06:28:57,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:28:57,080 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 58 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:28:57,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 577 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:28:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-13 06:28:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 156. [2024-10-13 06:28:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:28:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 222 transitions. [2024-10-13 06:28:57,092 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 222 transitions. Word has length 159 [2024-10-13 06:28:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:28:57,092 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 222 transitions. [2024-10-13 06:28:57,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:28:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 222 transitions. [2024-10-13 06:28:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 06:28:57,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:57,094 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:57,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:28:57,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:57,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:57,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1059586534, now seen corresponding path program 1 times [2024-10-13 06:28:57,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:57,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268858449] [2024-10-13 06:28:57,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:57,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268858449] [2024-10-13 06:28:57,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268858449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:57,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:57,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:28:57,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371857414] [2024-10-13 06:28:57,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:57,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:28:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:57,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:28:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:28:57,918 INFO L87 Difference]: Start difference. First operand 156 states and 222 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:28:58,136 INFO L93 Difference]: Finished difference Result 466 states and 664 transitions. [2024-10-13 06:28:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:28:58,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-10-13 06:28:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:28:58,139 INFO L225 Difference]: With dead ends: 466 [2024-10-13 06:28:58,139 INFO L226 Difference]: Without dead ends: 311 [2024-10-13 06:28:58,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:28:58,140 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 96 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:28:58,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 266 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:28:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-13 06:28:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 291. [2024-10-13 06:28:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 244 states have (on average 1.3442622950819672) internal successors, (328), 244 states have internal predecessors, (328), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:28:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 412 transitions. [2024-10-13 06:28:58,165 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 412 transitions. Word has length 159 [2024-10-13 06:28:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:28:58,165 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 412 transitions. [2024-10-13 06:28:58,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 412 transitions. [2024-10-13 06:28:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 06:28:58,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:58,167 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:58,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:28:58,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:58,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash -126267131, now seen corresponding path program 1 times [2024-10-13 06:28:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:58,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770334266] [2024-10-13 06:28:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:58,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:58,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:58,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770334266] [2024-10-13 06:28:58,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770334266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:58,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:58,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:28:58,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622549788] [2024-10-13 06:28:58,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:58,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:28:58,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:58,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:28:58,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:28:58,281 INFO L87 Difference]: Start difference. First operand 291 states and 412 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:28:58,394 INFO L93 Difference]: Finished difference Result 584 states and 826 transitions. [2024-10-13 06:28:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:28:58,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 160 [2024-10-13 06:28:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:28:58,398 INFO L225 Difference]: With dead ends: 584 [2024-10-13 06:28:58,398 INFO L226 Difference]: Without dead ends: 294 [2024-10-13 06:28:58,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:28:58,399 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 2 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:28:58,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 390 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:28:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-13 06:28:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2024-10-13 06:28:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 244 states have (on average 1.319672131147541) internal successors, (322), 244 states have internal predecessors, (322), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:28:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 406 transitions. [2024-10-13 06:28:58,419 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 406 transitions. Word has length 160 [2024-10-13 06:28:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:28:58,419 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 406 transitions. [2024-10-13 06:28:58,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:28:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 406 transitions. [2024-10-13 06:28:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 06:28:58,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:28:58,422 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:28:58,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:28:58,422 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:28:58,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:28:58,423 INFO L85 PathProgramCache]: Analyzing trace with hash -691031324, now seen corresponding path program 1 times [2024-10-13 06:28:58,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:28:58,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776466121] [2024-10-13 06:28:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:28:58,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:28:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:28:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:28:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:28:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:28:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:28:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:28:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:28:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:28:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:28:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:28:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:28:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:28:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:28:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:28:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:28:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:28:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:28:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:28:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:28:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:28:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:28:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:28:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:28:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:28:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776466121] [2024-10-13 06:28:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776466121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:28:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:28:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:28:59,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717378629] [2024-10-13 06:28:59,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:28:59,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:28:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:28:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:28:59,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:28:59,699 INFO L87 Difference]: Start difference. First operand 291 states and 406 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:29:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:00,202 INFO L93 Difference]: Finished difference Result 763 states and 1052 transitions. [2024-10-13 06:29:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:29:00,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2024-10-13 06:29:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:00,205 INFO L225 Difference]: With dead ends: 763 [2024-10-13 06:29:00,205 INFO L226 Difference]: Without dead ends: 473 [2024-10-13 06:29:00,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:29:00,208 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 76 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:00,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1116 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:29:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-13 06:29:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 463. [2024-10-13 06:29:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 396 states have (on average 1.3080808080808082) internal successors, (518), 398 states have internal predecessors, (518), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:29:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 634 transitions. [2024-10-13 06:29:00,238 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 634 transitions. Word has length 161 [2024-10-13 06:29:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:00,239 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 634 transitions. [2024-10-13 06:29:00,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:29:00,239 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 634 transitions. [2024-10-13 06:29:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 06:29:00,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:00,241 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:00,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:29:00,242 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:00,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash -825044830, now seen corresponding path program 1 times [2024-10-13 06:29:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:29:00,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053549332] [2024-10-13 06:29:00,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:29:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:29:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:29:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:29:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:29:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:29:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:29:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:29:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:29:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:29:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:29:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:29:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:29:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:29:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:29:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:29:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:29:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:29:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:29:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:29:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:29:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:29:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:29:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:29:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053549332] [2024-10-13 06:29:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053549332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:02,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:02,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 06:29:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766709109] [2024-10-13 06:29:02,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:02,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:29:02,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:29:02,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:29:02,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:29:02,477 INFO L87 Difference]: Start difference. First operand 463 states and 634 transitions. Second operand has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:29:03,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:03,933 INFO L93 Difference]: Finished difference Result 1019 states and 1392 transitions. [2024-10-13 06:29:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:29:03,934 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 161 [2024-10-13 06:29:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:03,938 INFO L225 Difference]: With dead ends: 1019 [2024-10-13 06:29:03,938 INFO L226 Difference]: Without dead ends: 557 [2024-10-13 06:29:03,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:29:03,939 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 71 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:03,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1270 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 06:29:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-13 06:29:03,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 467. [2024-10-13 06:29:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 400 states have (on average 1.305) internal successors, (522), 402 states have internal predecessors, (522), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:29:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 638 transitions. [2024-10-13 06:29:03,971 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 638 transitions. Word has length 161 [2024-10-13 06:29:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:03,972 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 638 transitions. [2024-10-13 06:29:03,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:29:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 638 transitions. [2024-10-13 06:29:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 06:29:03,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:03,975 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:03,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:29:03,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:03,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2133500446, now seen corresponding path program 1 times [2024-10-13 06:29:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:29:03,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558612542] [2024-10-13 06:29:03,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:29:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:29:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:29:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:29:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:29:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:29:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:29:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:29:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:29:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:29:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:29:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:29:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:29:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:29:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:29:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:29:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:29:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:29:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:29:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:29:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:29:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:29:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:29:06,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:29:06,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558612542] [2024-10-13 06:29:06,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558612542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:06,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:06,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:29:06,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167283513] [2024-10-13 06:29:06,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:06,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:29:06,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:29:06,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:29:06,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:29:06,183 INFO L87 Difference]: Start difference. First operand 467 states and 638 transitions. Second operand has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:29:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:07,620 INFO L93 Difference]: Finished difference Result 1043 states and 1418 transitions. [2024-10-13 06:29:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:29:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 161 [2024-10-13 06:29:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:07,624 INFO L225 Difference]: With dead ends: 1043 [2024-10-13 06:29:07,625 INFO L226 Difference]: Without dead ends: 577 [2024-10-13 06:29:07,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:29:07,627 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 84 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:07,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1101 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 06:29:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-13 06:29:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 467. [2024-10-13 06:29:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 400 states have (on average 1.305) internal successors, (522), 402 states have internal predecessors, (522), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:29:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 638 transitions. [2024-10-13 06:29:07,654 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 638 transitions. Word has length 161 [2024-10-13 06:29:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:07,655 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 638 transitions. [2024-10-13 06:29:07,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:29:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 638 transitions. [2024-10-13 06:29:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 06:29:07,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:07,657 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:07,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:29:07,658 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:07,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:07,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1546694432, now seen corresponding path program 1 times [2024-10-13 06:29:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:29:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631923251] [2024-10-13 06:29:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:29:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:29:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:29:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:29:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:29:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:29:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:29:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:29:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:29:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:29:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:29:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:29:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:29:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:29:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:29:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:29:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:29:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:29:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:29:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:29:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:29:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:29:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:29:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:29:08,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631923251] [2024-10-13 06:29:08,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631923251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:08,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:08,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:29:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450050126] [2024-10-13 06:29:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:08,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:29:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:29:08,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:29:08,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:29:08,862 INFO L87 Difference]: Start difference. First operand 467 states and 638 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:09,235 INFO L93 Difference]: Finished difference Result 1087 states and 1476 transitions. [2024-10-13 06:29:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:29:09,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2024-10-13 06:29:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:09,240 INFO L225 Difference]: With dead ends: 1087 [2024-10-13 06:29:09,240 INFO L226 Difference]: Without dead ends: 621 [2024-10-13 06:29:09,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:29:09,242 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 55 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:09,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 693 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:29:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-13 06:29:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 457. [2024-10-13 06:29:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 390 states have (on average 1.2923076923076924) internal successors, (504), 392 states have internal predecessors, (504), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:29:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 620 transitions. [2024-10-13 06:29:09,275 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 620 transitions. Word has length 161 [2024-10-13 06:29:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:09,277 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 620 transitions. [2024-10-13 06:29:09,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 620 transitions. [2024-10-13 06:29:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 06:29:09,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:09,279 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:09,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:29:09,279 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:09,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1497268918, now seen corresponding path program 1 times [2024-10-13 06:29:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:29:09,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931477829] [2024-10-13 06:29:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:29:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:29:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:29:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:29:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:29:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:29:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:29:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:29:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:29:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:29:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:29:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:29:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:29:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:29:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:29:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:29:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:29:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:29:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:29:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:29:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:29:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:29:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:29:10,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:29:10,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931477829] [2024-10-13 06:29:10,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931477829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:10,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:10,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:29:10,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352658597] [2024-10-13 06:29:10,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:10,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:29:10,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:29:10,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:29:10,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:29:10,148 INFO L87 Difference]: Start difference. First operand 457 states and 620 transitions. Second operand has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:29:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:10,658 INFO L93 Difference]: Finished difference Result 1197 states and 1598 transitions. [2024-10-13 06:29:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:29:10,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 162 [2024-10-13 06:29:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:10,663 INFO L225 Difference]: With dead ends: 1197 [2024-10-13 06:29:10,663 INFO L226 Difference]: Without dead ends: 741 [2024-10-13 06:29:10,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:29:10,665 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 69 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:10,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 888 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:29:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-10-13 06:29:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 713. [2024-10-13 06:29:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 600 states have (on average 1.2533333333333334) internal successors, (752), 606 states have internal predecessors, (752), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:29:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 944 transitions. [2024-10-13 06:29:10,711 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 944 transitions. Word has length 162 [2024-10-13 06:29:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:10,712 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 944 transitions. [2024-10-13 06:29:10,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:29:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 944 transitions. [2024-10-13 06:29:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 06:29:10,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:10,714 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:10,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:29:10,715 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:10,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:10,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1237839434, now seen corresponding path program 1 times [2024-10-13 06:29:10,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:29:10,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082583977] [2024-10-13 06:29:10,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:10,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:29:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:29:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:29:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:29:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:29:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:29:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:29:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:29:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:29:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:29:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:29:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:29:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:29:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:29:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:29:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:29:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:29:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:29:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:29:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:29:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:29:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:29:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:29:11,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:29:11,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082583977] [2024-10-13 06:29:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082583977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:11,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:29:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572639744] [2024-10-13 06:29:11,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:11,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:29:11,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:29:11,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:29:11,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:29:11,458 INFO L87 Difference]: Start difference. First operand 713 states and 944 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:11,710 INFO L93 Difference]: Finished difference Result 1457 states and 1933 transitions. [2024-10-13 06:29:11,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:29:11,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 162 [2024-10-13 06:29:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:11,715 INFO L225 Difference]: With dead ends: 1457 [2024-10-13 06:29:11,716 INFO L226 Difference]: Without dead ends: 745 [2024-10-13 06:29:11,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:29:11,721 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 89 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:11,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 301 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:29:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-10-13 06:29:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 713. [2024-10-13 06:29:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 600 states have (on average 1.2466666666666666) internal successors, (748), 606 states have internal predecessors, (748), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:29:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 940 transitions. [2024-10-13 06:29:11,764 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 940 transitions. Word has length 162 [2024-10-13 06:29:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:11,765 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 940 transitions. [2024-10-13 06:29:11,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 940 transitions. [2024-10-13 06:29:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 06:29:11,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:11,768 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:11,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:29:11,768 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:11,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash 803553672, now seen corresponding path program 1 times [2024-10-13 06:29:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:29:11,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056171178] [2024-10-13 06:29:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:29:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:29:11,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114893080] [2024-10-13 06:29:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:11,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:29:11,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:29:11,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:29:11,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:29:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:12,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-13 06:29:12,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:29:12,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:29:12,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:29:12,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:29:12,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:29:12,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:29:12,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:29:12,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:29:12,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2024-10-13 06:29:12,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:12,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2024-10-13 06:29:12,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:12,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 60 [2024-10-13 06:29:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:29:13,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:29:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:29:13,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056171178] [2024-10-13 06:29:13,027 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:29:13,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114893080] [2024-10-13 06:29:13,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114893080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:13,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:13,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:29:13,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19460756] [2024-10-13 06:29:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:13,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:29:13,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:29:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:29:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:29:13,030 INFO L87 Difference]: Start difference. First operand 713 states and 940 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:14,067 INFO L93 Difference]: Finished difference Result 1568 states and 2064 transitions. [2024-10-13 06:29:14,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:29:14,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 162 [2024-10-13 06:29:14,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:14,074 INFO L225 Difference]: With dead ends: 1568 [2024-10-13 06:29:14,074 INFO L226 Difference]: Without dead ends: 856 [2024-10-13 06:29:14,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:29:14,076 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 160 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:14,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 385 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:29:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2024-10-13 06:29:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 725. [2024-10-13 06:29:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 612 states have (on average 1.2434640522875817) internal successors, (761), 618 states have internal predecessors, (761), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:29:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 953 transitions. [2024-10-13 06:29:14,113 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 953 transitions. Word has length 162 [2024-10-13 06:29:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:14,114 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 953 transitions. [2024-10-13 06:29:14,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 953 transitions. [2024-10-13 06:29:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 06:29:14,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:14,115 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:14,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:29:14,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 06:29:14,320 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:14,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:14,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1498569768, now seen corresponding path program 1 times [2024-10-13 06:29:14,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:29:14,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286628305] [2024-10-13 06:29:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:14,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:29:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:29:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:29:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:29:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:29:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:29:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:29:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:29:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:29:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:29:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:29:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:29:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:29:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:29:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:29:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:29:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:29:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:29:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:29:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:29:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:29:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:29:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:29:14,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:29:14,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286628305] [2024-10-13 06:29:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286628305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:14,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:14,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:29:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089758331] [2024-10-13 06:29:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:14,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:29:14,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:29:14,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:29:14,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:29:14,553 INFO L87 Difference]: Start difference. First operand 725 states and 953 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:14,872 INFO L93 Difference]: Finished difference Result 1491 states and 1971 transitions. [2024-10-13 06:29:14,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:29:14,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2024-10-13 06:29:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:14,877 INFO L225 Difference]: With dead ends: 1491 [2024-10-13 06:29:14,878 INFO L226 Difference]: Without dead ends: 1112 [2024-10-13 06:29:14,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:29:14,880 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 139 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:14,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 351 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:29:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2024-10-13 06:29:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1075. [2024-10-13 06:29:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 906 states have (on average 1.2384105960264902) internal successors, (1122), 915 states have internal predecessors, (1122), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 135 states have call predecessors, (144), 144 states have call successors, (144) [2024-10-13 06:29:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1410 transitions. [2024-10-13 06:29:14,959 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1410 transitions. Word has length 164 [2024-10-13 06:29:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:14,959 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1410 transitions. [2024-10-13 06:29:14,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1410 transitions. [2024-10-13 06:29:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 06:29:14,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:14,962 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:14,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:29:14,962 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:14,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1452804405, now seen corresponding path program 1 times [2024-10-13 06:29:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:29:14,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170148437] [2024-10-13 06:29:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:29:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:29:15,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [550418510] [2024-10-13 06:29:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:29:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:29:15,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:29:15,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 06:29:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:29:15,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:29:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:29:15,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:29:15,775 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:29:15,776 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:29:15,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:29:15,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:29:15,983 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:29:16,052 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:29:16,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:29:16 BoogieIcfgContainer [2024-10-13 06:29:16,057 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:29:16,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:29:16,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:29:16,058 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:29:16,058 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:28:48" (3/4) ... [2024-10-13 06:29:16,060 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:29:16,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:29:16,062 INFO L158 Benchmark]: Toolchain (without parser) took 29122.96ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 975.2MB). Free memory was 77.8MB in the beginning and 893.4MB in the end (delta: -815.7MB). Peak memory consumption was 162.4MB. Max. memory is 16.1GB. [2024-10-13 06:29:16,062 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 151.0MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:29:16,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.17ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 77.5MB in the beginning and 164.3MB in the end (delta: -86.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-10-13 06:29:16,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.89ms. Allocated memory is still 199.2MB. Free memory was 164.3MB in the beginning and 160.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:29:16,063 INFO L158 Benchmark]: Boogie Preprocessor took 76.84ms. Allocated memory is still 199.2MB. Free memory was 160.1MB in the beginning and 155.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:29:16,063 INFO L158 Benchmark]: RCFGBuilder took 821.75ms. Allocated memory is still 199.2MB. Free memory was 155.9MB in the beginning and 118.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-13 06:29:16,064 INFO L158 Benchmark]: TraceAbstraction took 27755.88ms. Allocated memory was 199.2MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 117.1MB in the beginning and 893.4MB in the end (delta: -776.4MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. [2024-10-13 06:29:16,064 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 1.1GB. Free memory is still 893.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:29:16,065 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.13ms. Allocated memory is still 151.0MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.17ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 77.5MB in the beginning and 164.3MB in the end (delta: -86.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.89ms. Allocated memory is still 199.2MB. Free memory was 164.3MB in the beginning and 160.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.84ms. Allocated memory is still 199.2MB. Free memory was 160.1MB in the beginning and 155.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 821.75ms. Allocated memory is still 199.2MB. Free memory was 155.9MB in the beginning and 118.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27755.88ms. Allocated memory was 199.2MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 117.1MB in the beginning and 893.4MB in the end (delta: -776.4MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 1.1GB. Free memory is still 893.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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someUnaryFLOAToperation at line 122. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] FCALL updateLastVariables() [L130] CALL updateVariables() [L86] WrapperStruct00.var_1_3 = __VERIFIER_nondet_char() [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -128) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L90] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L93] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_7 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_7 != 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] WrapperStruct00.var_1_19 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_19 [L117] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_19 [L117] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] RET updateVariables() [L131] CALL step() [L60] EXPR WrapperStruct00.var_1_4 [L60] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) [L60] EXPR WrapperStruct00.var_1_3 [L60] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L60] EXPR WrapperStruct00.var_1_7 [L60] signed long int stepLocal_1 = ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7; [L61] EXPR WrapperStruct00.var_1_5 [L61] EXPR WrapperStruct00.var_1_6 [L61] signed long int stepLocal_0 = WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6; [L62] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L62] COND FALSE !(WrapperStruct00.var_1_4 > stepLocal_0) [L67] EXPR WrapperStruct00.var_1_3 [L67] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_3 [L69] EXPR WrapperStruct00.var_1_19 [L69] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L70] EXPR WrapperStruct00.var_1_12 [L70] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] EXPR ((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) [L70] EXPR WrapperStruct00.var_1_18 [L70] EXPR ((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=-1] [L70] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND FALSE !((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) [L73] EXPR WrapperStruct00.var_1_1 [L73] signed long int stepLocal_3 = WrapperStruct00.var_1_1; [L74] EXPR WrapperStruct00.var_1_1 [L74] EXPR WrapperStruct00.var_1_1 [L74] EXPR WrapperStruct00.var_1_6 [L74] signed long int stepLocal_2 = WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6); [L75] WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] COND TRUE WrapperStruct00.var_1_11 [L76] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L76] COND FALSE !(stepLocal_3 > WrapperStruct00.var_1_1) [L79] EXPR WrapperStruct00.var_1_1 [L79] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] COND TRUE (WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < stepLocal_2 [L80] EXPR WrapperStruct00.var_1_10 [L80] WrapperStruct00.var_1_8 = WrapperStruct00.var_1_10 [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR WrapperStruct00.var_1_4 [L122] EXPR WrapperStruct00.var_1_5 [L122] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) [L122] EXPR WrapperStruct00.var_1_1 [L122] EXPR WrapperStruct00.var_1_3 [L122] EXPR (WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1) [L122] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1 [L122] EXPR WrapperStruct00.var_1_1 [L122] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1) [L122] EXPR WrapperStruct00.var_1_1 [L122] EXPR WrapperStruct00.var_1_7 [L122] EXPR WrapperStruct00.var_1_1 [L122] EXPR WrapperStruct00.var_1_1 [L122] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1 [L122] EXPR WrapperStruct00.var_1_8 [L122] EXPR WrapperStruct00.var_1_10 [L122] EXPR ((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1) [L122] EXPR WrapperStruct00.var_1_12 [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) [L122] EXPR WrapperStruct00.var_1_18 [L122] EXPR ((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1 [L122] EXPR ((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1)) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1)) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19)) [L122] EXPR WrapperStruct00.var_1_18 [L122] EXPR WrapperStruct00.var_1_19 [L122] EXPR ((((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1)) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122-L123] return ((((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1)) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.6s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1100 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1089 mSDsluCounter, 10893 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8317 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6267 IncrementalHoareTripleChecker+Invalid, 6338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 2576 mSDtfsCounter, 6267 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1153 GetRequests, 1050 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1075occurred in iteration=18, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 756 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 3355 NumberOfCodeBlocks, 3355 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2843 ConstructedInterpolants, 0 QuantifiedInterpolants, 9861 SizeOfPredicates, 6 NumberOfNonLiveVariables, 511 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 15120/15120 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-13 06:29:16,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5e750e5fa316e30fef8e3158d304f9d418ce308f7b74e89da459ba726747abe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:29:18,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:29:18,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:29:18,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:29:18,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:29:18,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:29:18,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:29:18,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:29:18,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:29:18,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:29:18,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:29:18,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:29:18,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:29:18,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:29:18,542 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:29:18,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:29:18,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:29:18,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:29:18,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:29:18,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:29:18,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:29:18,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:29:18,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:29:18,547 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:29:18,547 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:29:18,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:29:18,548 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:29:18,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:29:18,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:29:18,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:29:18,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:29:18,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:29:18,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:29:18,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:29:18,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:29:18,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:29:18,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:29:18,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:29:18,550 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:29:18,550 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:29:18,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:29:18,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:29:18,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:29:18,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:29:18,552 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:29:18,552 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5e750e5fa316e30fef8e3158d304f9d418ce308f7b74e89da459ba726747abe [2024-10-13 06:29:18,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:29:18,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:29:18,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:29:18,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:29:18,908 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:29:18,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i [2024-10-13 06:29:20,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:29:20,591 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:29:20,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i [2024-10-13 06:29:20,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfba3c331/4ffe8ac9d7d44606b67475a4e1642209/FLAGe70407a49 [2024-10-13 06:29:20,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfba3c331/4ffe8ac9d7d44606b67475a4e1642209 [2024-10-13 06:29:20,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:29:20,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:29:20,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:29:20,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:29:20,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:29:20,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:29:20" (1/1) ... [2024-10-13 06:29:20,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff95950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:20, skipping insertion in model container [2024-10-13 06:29:20,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:29:20" (1/1) ... [2024-10-13 06:29:21,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:29:21,164 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i[916,929] [2024-10-13 06:29:21,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:29:21,260 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:29:21,272 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i[916,929] [2024-10-13 06:29:21,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:29:21,351 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:29:21,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21 WrapperNode [2024-10-13 06:29:21,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:29:21,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:29:21,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:29:21,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:29:21,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,411 INFO L138 Inliner]: procedures = 36, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2024-10-13 06:29:21,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:29:21,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:29:21,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:29:21,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:29:21,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,459 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 17 writes are split as follows [0, 17]. [2024-10-13 06:29:21,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:29:21,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:29:21,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:29:21,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:29:21,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (1/1) ... [2024-10-13 06:29:21,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:29:21,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:29:21,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:29:21,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:29:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:29:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:29:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:29:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:29:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:29:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:29:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:29:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:29:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:29:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:29:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:29:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:29:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:29:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:29:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:29:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:29:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:29:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:29:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:29:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:29:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:29:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:29:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:29:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:29:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:29:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:29:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:29:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:29:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:29:21,724 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:29:21,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:29:24,946 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-13 06:29:24,946 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:29:24,986 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:29:24,987 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:29:24,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:29:24 BoogieIcfgContainer [2024-10-13 06:29:24,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:29:24,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:29:24,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:29:24,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:29:24,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:29:20" (1/3) ... [2024-10-13 06:29:24,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7674594e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:29:24, skipping insertion in model container [2024-10-13 06:29:24,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:29:21" (2/3) ... [2024-10-13 06:29:24,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7674594e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:29:24, skipping insertion in model container [2024-10-13 06:29:24,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:29:24" (3/3) ... [2024-10-13 06:29:25,010 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-44.i [2024-10-13 06:29:25,026 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:29:25,026 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:29:25,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:29:25,098 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;@390fe791, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:29:25,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:29:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:29:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:29:25,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:25,118 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:25,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:25,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash -428167194, now seen corresponding path program 1 times [2024-10-13 06:29:25,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:29:25,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159393356] [2024-10-13 06:29:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:25,142 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-13 06:29:25,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:29:25,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:25,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:25,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:29:25,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:29:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-10-13 06:29:25,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:29:25,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:29:25,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159393356] [2024-10-13 06:29:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159393356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:25,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:25,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:29:25,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181498680] [2024-10-13 06:29:25,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:25,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:29:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:29:25,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:29:25,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:29:25,618 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:29:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:25,677 INFO L93 Difference]: Finished difference Result 219 states and 349 transitions. [2024-10-13 06:29:25,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:29:25,680 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2024-10-13 06:29:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:25,687 INFO L225 Difference]: With dead ends: 219 [2024-10-13 06:29:25,688 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 06:29:25,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:29:25,697 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:25,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:29:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 06:29:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-13 06:29:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:29:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-10-13 06:29:25,749 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 154 [2024-10-13 06:29:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:25,750 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-10-13 06:29:25,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:29:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-10-13 06:29:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:29:25,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:25,757 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:25,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2024-10-13 06:29:25,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:25,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:25,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash -686195368, now seen corresponding path program 1 times [2024-10-13 06:29:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:29:25,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962466084] [2024-10-13 06:29:25,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:25,960 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-13 06:29:25,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:29:25,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:25,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:26,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:29:26,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:29:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:29:26,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:29:26,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:29:26,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962466084] [2024-10-13 06:29:26,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962466084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:26,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:26,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:29:26,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388206830] [2024-10-13 06:29:26,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:26,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:29:26,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:29:26,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:29:26,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:29:26,380 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:26,509 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2024-10-13 06:29:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:29:26,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-13 06:29:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:26,514 INFO L225 Difference]: With dead ends: 222 [2024-10-13 06:29:26,516 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 06:29:26,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:29:26,519 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:26,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 598 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:29:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 06:29:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-13 06:29:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:29:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-10-13 06:29:26,539 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 154 [2024-10-13 06:29:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:26,545 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-10-13 06:29:26,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-10-13 06:29:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:29:26,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:26,548 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:26,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2024-10-13 06:29:26,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:26,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:26,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -686135786, now seen corresponding path program 1 times [2024-10-13 06:29:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:29:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390954601] [2024-10-13 06:29:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:26,751 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-13 06:29:26,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:29:26,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:26,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (4)] Waiting until timeout for monitored process [2024-10-13 06:29:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:27,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:29:27,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:29:27,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:27,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-13 06:29:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-13 06:29:27,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:29:27,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:29:27,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390954601] [2024-10-13 06:29:27,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390954601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:27,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:27,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:29:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191526627] [2024-10-13 06:29:27,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:27,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:29:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:29:27,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:29:27,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:29:27,758 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:29:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:31,770 INFO L93 Difference]: Finished difference Result 226 states and 328 transitions. [2024-10-13 06:29:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:29:31,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2024-10-13 06:29:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:31,778 INFO L225 Difference]: With dead ends: 226 [2024-10-13 06:29:31,778 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 06:29:31,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:29:31,780 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 116 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:31,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 450 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-13 06:29:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 06:29:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-13 06:29:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:29:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-10-13 06:29:31,793 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 154 [2024-10-13 06:29:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:31,797 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-10-13 06:29:31,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:29:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-10-13 06:29:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 06:29:31,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:31,803 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:31,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (4)] Forceful destruction successful, exit code 0 [2024-10-13 06:29:32,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:32,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:32,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:32,004 INFO L85 PathProgramCache]: Analyzing trace with hash -945839984, now seen corresponding path program 1 times [2024-10-13 06:29:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:29:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597875816] [2024-10-13 06:29:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:32,005 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-13 06:29:32,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:29:32,008 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:32,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (5)] Waiting until timeout for monitored process [2024-10-13 06:29:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:32,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 06:29:32,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:29:32,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-13 06:29:32,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:32,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-13 06:29:32,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:32,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-13 06:29:33,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:33,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-10-13 06:29:33,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:33,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2024-10-13 06:29:34,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:34,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2024-10-13 06:29:34,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:34,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 66 [2024-10-13 06:29:34,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:34,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2024-10-13 06:29:34,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:34,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76 [2024-10-13 06:29:35,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:35,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2024-10-13 06:29:35,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:35,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 92 [2024-10-13 06:29:36,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:36,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 92 [2024-10-13 06:29:36,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:36,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 92 [2024-10-13 06:29:36,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:36,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 33 [2024-10-13 06:29:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-10-13 06:29:36,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:29:36,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:29:36,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597875816] [2024-10-13 06:29:36,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597875816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:36,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:36,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:29:36,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172617685] [2024-10-13 06:29:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:36,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:29:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:29:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:29:36,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:29:36,459 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 6 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2024-10-13 06:29:39,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 06:29:42,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 06:29:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:42,127 INFO L93 Difference]: Finished difference Result 337 states and 487 transitions. [2024-10-13 06:29:42,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:29:42,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 6 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 156 [2024-10-13 06:29:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:42,130 INFO L225 Difference]: With dead ends: 337 [2024-10-13 06:29:42,130 INFO L226 Difference]: Without dead ends: 225 [2024-10-13 06:29:42,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:29:42,132 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 195 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:42,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 351 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-13 06:29:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-13 06:29:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 217. [2024-10-13 06:29:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 172 states have internal predecessors, (230), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:29:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 314 transitions. [2024-10-13 06:29:42,181 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 314 transitions. Word has length 156 [2024-10-13 06:29:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:42,182 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 314 transitions. [2024-10-13 06:29:42,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 6 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2024-10-13 06:29:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 314 transitions. [2024-10-13 06:29:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:29:42,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:42,187 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:42,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (5)] Ended with exit code 0 [2024-10-13 06:29:42,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:42,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:42,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1756354117, now seen corresponding path program 1 times [2024-10-13 06:29:42,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:29:42,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164934896] [2024-10-13 06:29:42,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:42,390 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-13 06:29:42,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:29:42,392 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:42,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (6)] Waiting until timeout for monitored process [2024-10-13 06:29:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:43,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:29:43,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:29:43,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 06:29:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:29:43,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:29:43,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:29:43,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164934896] [2024-10-13 06:29:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164934896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:43,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:43,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:29:43,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878984265] [2024-10-13 06:29:43,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:43,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:29:43,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:29:43,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:29:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:29:43,074 INFO L87 Difference]: Start difference. First operand 217 states and 314 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:44,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:29:45,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:29:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:45,973 INFO L93 Difference]: Finished difference Result 434 states and 628 transitions. [2024-10-13 06:29:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:29:45,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2024-10-13 06:29:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:45,979 INFO L225 Difference]: With dead ends: 434 [2024-10-13 06:29:45,979 INFO L226 Difference]: Without dead ends: 218 [2024-10-13 06:29:45,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:29:45,980 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 2 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:45,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 389 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 06:29:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-13 06:29:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2024-10-13 06:29:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.3255813953488371) internal successors, (228), 172 states have internal predecessors, (228), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:29:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 312 transitions. [2024-10-13 06:29:46,007 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 312 transitions. Word has length 157 [2024-10-13 06:29:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:46,007 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 312 transitions. [2024-10-13 06:29:46,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:29:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 312 transitions. [2024-10-13 06:29:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 06:29:46,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:46,010 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:46,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (6)] Ended with exit code 0 [2024-10-13 06:29:46,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:46,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:46,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash -573152678, now seen corresponding path program 1 times [2024-10-13 06:29:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:29:46,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963245865] [2024-10-13 06:29:46,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:46,212 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-13 06:29:46,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:29:46,215 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:46,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (7)] Waiting until timeout for monitored process [2024-10-13 06:29:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:46,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 06:29:46,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:29:46,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:29:46,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:29:46,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:29:46,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:29:46,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:29:46,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 06:29:46,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 14 [2024-10-13 06:29:46,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-13 06:29:47,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:47,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-13 06:29:47,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:47,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-10-13 06:29:47,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:47,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2024-10-13 06:29:47,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:47,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 71 [2024-10-13 06:29:47,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:47,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 74 [2024-10-13 06:29:47,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:29:47,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 77 treesize of output 85 [2024-10-13 06:29:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-10-13 06:29:48,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:29:48,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:29:48,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963245865] [2024-10-13 06:29:48,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963245865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:29:48,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:29:48,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:29:48,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614444829] [2024-10-13 06:29:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:29:48,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:29:48,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:29:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:29:48,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:29:48,037 INFO L87 Difference]: Start difference. First operand 217 states and 312 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-13 06:29:54,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 06:29:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:29:54,923 INFO L93 Difference]: Finished difference Result 611 states and 873 transitions. [2024-10-13 06:29:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:29:54,925 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 158 [2024-10-13 06:29:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:29:54,927 INFO L225 Difference]: With dead ends: 611 [2024-10-13 06:29:54,927 INFO L226 Difference]: Without dead ends: 395 [2024-10-13 06:29:54,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:29:54,931 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 319 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:29:54,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 382 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-10-13 06:29:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-13 06:29:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 247. [2024-10-13 06:29:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 202 states have (on average 1.3366336633663367) internal successors, (270), 202 states have internal predecessors, (270), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:29:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 354 transitions. [2024-10-13 06:29:54,966 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 354 transitions. Word has length 158 [2024-10-13 06:29:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:29:54,967 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 354 transitions. [2024-10-13 06:29:54,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-13 06:29:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 354 transitions. [2024-10-13 06:29:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 06:29:54,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:29:54,972 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:29:54,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (7)] Ended with exit code 0 [2024-10-13 06:29:55,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:55,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:29:55,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:29:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash 515993600, now seen corresponding path program 1 times [2024-10-13 06:29:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:29:55,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190397017] [2024-10-13 06:29:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:29:55,175 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-13 06:29:55,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:29:55,178 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-13 06:29:55,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (8)] Waiting until timeout for monitored process [2024-10-13 06:29:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:29:55,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 06:29:55,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:29:56,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2024-10-13 06:30:01,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:01,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 65