./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.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 b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 18:32:38,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 18:32:38,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 18:32:38,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 18:32:38,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 18:32:38,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 18:32:38,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 18:32:38,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 18:32:38,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 18:32:38,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 18:32:38,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 18:32:38,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 18:32:38,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 18:32:38,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 18:32:39,000 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 18:32:39,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 18:32:39,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 18:32:39,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 18:32:39,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 18:32:39,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 18:32:39,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 18:32:39,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 18:32:39,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 18:32:39,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 18:32:39,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 18:32:39,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 18:32:39,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 18:32:39,005 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 18:32:39,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 18:32:39,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 18:32:39,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 18:32:39,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 18:32:39,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:32:39,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 18:32:39,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 18:32:39,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 18:32:39,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 18:32:39,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 18:32:39,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 18:32:39,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 18:32:39,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 18:32:39,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 18:32:39,008 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 -> b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be [2024-11-18 18:32:39,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 18:32:39,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 18:32:39,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 18:32:39,236 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 18:32:39,237 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 18:32:39,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-18 18:32:40,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 18:32:40,613 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 18:32:40,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-18 18:32:40,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04baf0189/0460c639cb0e46f9b2653dc75afdec01/FLAGc34c0707c [2024-11-18 18:32:41,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04baf0189/0460c639cb0e46f9b2653dc75afdec01 [2024-11-18 18:32:41,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 18:32:41,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 18:32:41,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 18:32:41,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 18:32:41,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 18:32:41,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30277487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41, skipping insertion in model container [2024-11-18 18:32:41,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 18:32:41,187 WARN L250 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_codestructure_functionizing_file-9.i[919,932] [2024-11-18 18:32:41,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:32:41,264 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 18:32:41,273 WARN L250 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_codestructure_functionizing_file-9.i[919,932] [2024-11-18 18:32:41,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:32:41,310 INFO L204 MainTranslator]: Completed translation [2024-11-18 18:32:41,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41 WrapperNode [2024-11-18 18:32:41,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 18:32:41,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 18:32:41,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 18:32:41,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 18:32:41,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,387 INFO L138 Inliner]: procedures = 30, calls = 38, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 216 [2024-11-18 18:32:41,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 18:32:41,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 18:32:41,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 18:32:41,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 18:32:41,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,435 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 18:32:41,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 18:32:41,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 18:32:41,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 18:32:41,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 18:32:41,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (1/1) ... [2024-11-18 18:32:41,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:32:41,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:41,492 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-11-18 18:32:41,494 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-11-18 18:32:41,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 18:32:41,530 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 18:32:41,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 18:32:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 18:32:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 18:32:41,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 18:32:41,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 18:32:41,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 18:32:41,854 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-18 18:32:41,855 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 18:32:41,865 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 18:32:41,866 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 18:32:41,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:32:41 BoogieIcfgContainer [2024-11-18 18:32:41,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 18:32:41,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 18:32:41,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 18:32:41,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 18:32:41,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:32:41" (1/3) ... [2024-11-18 18:32:41,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3ae424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:32:41, skipping insertion in model container [2024-11-18 18:32:41,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:41" (2/3) ... [2024-11-18 18:32:41,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3ae424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:32:41, skipping insertion in model container [2024-11-18 18:32:41,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:32:41" (3/3) ... [2024-11-18 18:32:41,872 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-9.i [2024-11-18 18:32:41,888 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 18:32:41,888 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 18:32:41,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 18:32:41,934 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;@e00184e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 18:32:41,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 18:32:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 62 states have internal predecessors, (84), 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-11-18 18:32:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-18 18:32:41,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:41,948 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] [2024-11-18 18:32:41,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:41,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:41,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1908118560, now seen corresponding path program 1 times [2024-11-18 18:32:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101289014] [2024-11-18 18:32:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-18 18:32:42,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:42,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101289014] [2024-11-18 18:32:42,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101289014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:32:42,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534867937] [2024-11-18 18:32:42,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:42,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:42,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:42,243 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-11-18 18:32:42,244 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-11-18 18:32:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:42,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 18:32:42,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-18 18:32:42,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:32:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534867937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:42,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 18:32:42,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 18:32:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039944483] [2024-11-18 18:32:42,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:42,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 18:32:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:42,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 18:32:42,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 18:32:42,432 INFO L87 Difference]: Start difference. First operand has 85 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 62 states have internal predecessors, (84), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-18 18:32:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:42,451 INFO L93 Difference]: Finished difference Result 163 states and 267 transitions. [2024-11-18 18:32:42,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 18:32:42,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 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 139 [2024-11-18 18:32:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:42,458 INFO L225 Difference]: With dead ends: 163 [2024-11-18 18:32:42,458 INFO L226 Difference]: Without dead ends: 81 [2024-11-18 18:32:42,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-11-18 18:32:42,474 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:42,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:32:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-18 18:32:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-18 18:32:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 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-11-18 18:32:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2024-11-18 18:32:42,559 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 139 [2024-11-18 18:32:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:42,560 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2024-11-18 18:32:42,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-18 18:32:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2024-11-18 18:32:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-18 18:32:42,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:42,563 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] [2024-11-18 18:32:42,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 18:32:42,763 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,SelfDestructingSolverStorable0 [2024-11-18 18:32:42,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:42,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:42,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1894686822, now seen corresponding path program 1 times [2024-11-18 18:32:42,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:42,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717642332] [2024-11-18 18:32:42,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:42,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:32:43,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:43,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717642332] [2024-11-18 18:32:43,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717642332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:43,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:32:43,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 18:32:43,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933836888] [2024-11-18 18:32:43,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:43,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 18:32:43,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:43,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 18:32:43,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 18:32:43,054 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-11-18 18:32:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:43,091 INFO L93 Difference]: Finished difference Result 160 states and 237 transitions. [2024-11-18 18:32:43,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 18:32:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 139 [2024-11-18 18:32:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:43,097 INFO L225 Difference]: With dead ends: 160 [2024-11-18 18:32:43,098 INFO L226 Difference]: Without dead ends: 82 [2024-11-18 18:32:43,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-18 18:32:43,099 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:43,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:32:43,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-18 18:32:43,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-18 18:32:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 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-11-18 18:32:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2024-11-18 18:32:43,114 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 139 [2024-11-18 18:32:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:43,116 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2024-11-18 18:32:43,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-11-18 18:32:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2024-11-18 18:32:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 18:32:43,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:43,120 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] [2024-11-18 18:32:43,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 18:32:43,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:43,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1128868079, now seen corresponding path program 1 times [2024-11-18 18:32:43,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:43,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210025493] [2024-11-18 18:32:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:32:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210025493] [2024-11-18 18:32:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210025493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:32:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205224430] [2024-11-18 18:32:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:44,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:44,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:44,706 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-11-18 18:32:44,709 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-11-18 18:32:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:44,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 18:32:44,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:32:44,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:32:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205224430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:44,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 18:32:44,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2024-11-18 18:32:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346623827] [2024-11-18 18:32:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:44,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 18:32:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 18:32:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-18 18:32:44,994 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-18 18:32:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:45,199 INFO L93 Difference]: Finished difference Result 248 states and 356 transitions. [2024-11-18 18:32:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 18:32:45,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 140 [2024-11-18 18:32:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:45,205 INFO L225 Difference]: With dead ends: 248 [2024-11-18 18:32:45,205 INFO L226 Difference]: Without dead ends: 169 [2024-11-18 18:32:45,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-18 18:32:45,206 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 129 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:45,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 480 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 18:32:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-18 18:32:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 140. [2024-11-18 18:32:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.375) internal successors, (154), 113 states have internal predecessors, (154), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-18 18:32:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 204 transitions. [2024-11-18 18:32:45,227 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 204 transitions. Word has length 140 [2024-11-18 18:32:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:45,227 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 204 transitions. [2024-11-18 18:32:45,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-18 18:32:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 204 transitions. [2024-11-18 18:32:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 18:32:45,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:45,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] [2024-11-18 18:32:45,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 18:32:45,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-18 18:32:45,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:45,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:45,435 INFO L85 PathProgramCache]: Analyzing trace with hash 107799725, now seen corresponding path program 1 times [2024-11-18 18:32:45,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:45,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687122905] [2024-11-18 18:32:45,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:45,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:32:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:46,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687122905] [2024-11-18 18:32:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687122905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:32:46,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134779923] [2024-11-18 18:32:46,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:46,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:46,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 18:32:46,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 18:32:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:46,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 18:32:46,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:32:46,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:32:46,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134779923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:46,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 18:32:46,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2024-11-18 18:32:46,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437580162] [2024-11-18 18:32:46,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:46,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 18:32:46,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:46,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 18:32:46,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-18 18:32:46,568 INFO L87 Difference]: Start difference. First operand 140 states and 204 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-18 18:32:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:47,115 INFO L93 Difference]: Finished difference Result 308 states and 442 transitions. [2024-11-18 18:32:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 18:32:47,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 140 [2024-11-18 18:32:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:47,118 INFO L225 Difference]: With dead ends: 308 [2024-11-18 18:32:47,118 INFO L226 Difference]: Without dead ends: 171 [2024-11-18 18:32:47,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-18 18:32:47,119 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 104 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:47,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 552 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 18:32:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-18 18:32:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 124. [2024-11-18 18:32:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 96 states have (on average 1.34375) internal successors, (129), 97 states have internal predecessors, (129), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-18 18:32:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 179 transitions. [2024-11-18 18:32:47,139 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 179 transitions. Word has length 140 [2024-11-18 18:32:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:47,139 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 179 transitions. [2024-11-18 18:32:47,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-18 18:32:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 179 transitions. [2024-11-18 18:32:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 18:32:47,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:47,141 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] [2024-11-18 18:32:47,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 18:32:47,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:47,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:47,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash -459479823, now seen corresponding path program 1 times [2024-11-18 18:32:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:47,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927138051] [2024-11-18 18:32:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:47,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:32:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927138051] [2024-11-18 18:32:48,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927138051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:32:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254484074] [2024-11-18 18:32:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:48,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:48,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:48,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 18:32:48,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 18:32:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:48,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 18:32:48,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:32:48,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:32:48,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254484074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:48,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 18:32:48,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2024-11-18 18:32:48,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595575991] [2024-11-18 18:32:48,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:48,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 18:32:48,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:48,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 18:32:48,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-18 18:32:48,655 INFO L87 Difference]: Start difference. First operand 124 states and 179 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-11-18 18:32:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:48,922 INFO L93 Difference]: Finished difference Result 407 states and 581 transitions. [2024-11-18 18:32:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 18:32:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 140 [2024-11-18 18:32:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:48,925 INFO L225 Difference]: With dead ends: 407 [2024-11-18 18:32:48,925 INFO L226 Difference]: Without dead ends: 286 [2024-11-18 18:32:48,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-18 18:32:48,927 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 210 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:48,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 493 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 18:32:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-18 18:32:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 212. [2024-11-18 18:32:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 181 states have (on average 1.3977900552486189) internal successors, (253), 183 states have internal predecessors, (253), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-18 18:32:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 307 transitions. [2024-11-18 18:32:48,942 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 307 transitions. Word has length 140 [2024-11-18 18:32:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:48,943 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 307 transitions. [2024-11-18 18:32:48,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-11-18 18:32:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 307 transitions. [2024-11-18 18:32:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 18:32:48,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:48,944 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] [2024-11-18 18:32:48,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 18:32:49,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:49,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:49,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:49,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1480548177, now seen corresponding path program 1 times [2024-11-18 18:32:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368213685] [2024-11-18 18:32:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:49,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:32:49,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368213685] [2024-11-18 18:32:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368213685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:32:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933571677] [2024-11-18 18:32:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:49,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:49,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:49,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 18:32:49,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 18:32:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:49,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 18:32:49,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:32:50,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:32:50,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933571677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:50,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 18:32:50,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2024-11-18 18:32:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736996118] [2024-11-18 18:32:50,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:50,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 18:32:50,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:50,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 18:32:50,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-18 18:32:50,340 INFO L87 Difference]: Start difference. First operand 212 states and 307 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-11-18 18:32:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:50,725 INFO L93 Difference]: Finished difference Result 525 states and 743 transitions. [2024-11-18 18:32:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 18:32:50,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 140 [2024-11-18 18:32:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:50,728 INFO L225 Difference]: With dead ends: 525 [2024-11-18 18:32:50,728 INFO L226 Difference]: Without dead ends: 316 [2024-11-18 18:32:50,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-18 18:32:50,729 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 167 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:50,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 546 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 18:32:50,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-18 18:32:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 209. [2024-11-18 18:32:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 178 states have (on average 1.3932584269662922) internal successors, (248), 180 states have internal predecessors, (248), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-18 18:32:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 302 transitions. [2024-11-18 18:32:50,741 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 302 transitions. Word has length 140 [2024-11-18 18:32:50,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:50,741 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 302 transitions. [2024-11-18 18:32:50,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-11-18 18:32:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 302 transitions. [2024-11-18 18:32:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 18:32:50,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:50,743 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] [2024-11-18 18:32:50,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 18:32:50,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:50,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:50,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash -660985923, now seen corresponding path program 1 times [2024-11-18 18:32:50,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:50,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804666820] [2024-11-18 18:32:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:50,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:32:51,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804666820] [2024-11-18 18:32:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804666820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:32:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960980578] [2024-11-18 18:32:51,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:51,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:51,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:51,836 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 18:32:51,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 18:32:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:51,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 18:32:51,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 456 proven. 54 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-18 18:32:52,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:32:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:32:52,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960980578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 18:32:52,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 18:32:52,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-18 18:32:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861795456] [2024-11-18 18:32:52,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 18:32:52,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-18 18:32:52,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:52,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-18 18:32:52,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-18 18:32:52,328 INFO L87 Difference]: Start difference. First operand 209 states and 302 transitions. Second operand has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 5 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) [2024-11-18 18:32:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:53,762 INFO L93 Difference]: Finished difference Result 599 states and 843 transitions. [2024-11-18 18:32:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-18 18:32:53,763 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 5 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) Word has length 141 [2024-11-18 18:32:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:53,765 INFO L225 Difference]: With dead ends: 599 [2024-11-18 18:32:53,765 INFO L226 Difference]: Without dead ends: 393 [2024-11-18 18:32:53,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=258, Invalid=932, Unknown=0, NotChecked=0, Total=1190 [2024-11-18 18:32:53,767 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 351 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:53,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 623 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 18:32:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-18 18:32:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 239. [2024-11-18 18:32:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 204 states have (on average 1.357843137254902) internal successors, (277), 206 states have internal predecessors, (277), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-18 18:32:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 331 transitions. [2024-11-18 18:32:53,789 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 331 transitions. Word has length 141 [2024-11-18 18:32:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:53,789 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 331 transitions. [2024-11-18 18:32:53,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 5 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) [2024-11-18 18:32:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 331 transitions. [2024-11-18 18:32:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 18:32:53,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:53,791 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] [2024-11-18 18:32:53,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 18:32:53,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:53,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:53,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:53,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1458827457, now seen corresponding path program 1 times [2024-11-18 18:32:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:53,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113865696] [2024-11-18 18:32:53,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:53,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:32:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113865696] [2024-11-18 18:32:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113865696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:32:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636137111] [2024-11-18 18:32:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:54,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:54,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:54,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 18:32:54,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 18:32:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:54,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-18 18:32:54,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 493 proven. 138 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-11-18 18:32:55,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:32:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:32:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636137111] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 18:32:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 18:32:55,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 18] total 24 [2024-11-18 18:32:55,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174848647] [2024-11-18 18:32:55,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:55,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 18:32:55,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:55,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 18:32:55,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-18 18:32:55,996 INFO L87 Difference]: Start difference. First operand 239 states and 331 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-11-18 18:32:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:56,302 INFO L93 Difference]: Finished difference Result 570 states and 780 transitions. [2024-11-18 18:32:56,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 18:32:56,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 141 [2024-11-18 18:32:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:56,304 INFO L225 Difference]: With dead ends: 570 [2024-11-18 18:32:56,304 INFO L226 Difference]: Without dead ends: 338 [2024-11-18 18:32:56,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2024-11-18 18:32:56,306 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 92 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:56,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 438 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 18:32:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-18 18:32:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 201. [2024-11-18 18:32:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 168 states have (on average 1.3392857142857142) internal successors, (225), 169 states have internal predecessors, (225), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-18 18:32:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 275 transitions. [2024-11-18 18:32:56,324 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 275 transitions. Word has length 141 [2024-11-18 18:32:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:56,324 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 275 transitions. [2024-11-18 18:32:56,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-11-18 18:32:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 275 transitions. [2024-11-18 18:32:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-18 18:32:56,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:56,325 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] [2024-11-18 18:32:56,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-18 18:32:56,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:56,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:56,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:56,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1962011690, now seen corresponding path program 1 times [2024-11-18 18:32:56,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:56,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046868672] [2024-11-18 18:32:56,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:56,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:32:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:56,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046868672] [2024-11-18 18:32:56,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046868672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:56,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:32:56,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 18:32:56,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186029413] [2024-11-18 18:32:56,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:56,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 18:32:56,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:56,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 18:32:56,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 18:32:56,597 INFO L87 Difference]: Start difference. First operand 201 states and 275 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-11-18 18:32:56,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:56,630 INFO L93 Difference]: Finished difference Result 434 states and 590 transitions. [2024-11-18 18:32:56,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 18:32:56,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 142 [2024-11-18 18:32:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:56,633 INFO L225 Difference]: With dead ends: 434 [2024-11-18 18:32:56,633 INFO L226 Difference]: Without dead ends: 236 [2024-11-18 18:32:56,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-18 18:32:56,634 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 45 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:56,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 221 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:32:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-18 18:32:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2024-11-18 18:32:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 187 states have (on average 1.320855614973262) internal successors, (247), 188 states have internal predecessors, (247), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-18 18:32:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 297 transitions. [2024-11-18 18:32:56,650 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 297 transitions. Word has length 142 [2024-11-18 18:32:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:56,651 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 297 transitions. [2024-11-18 18:32:56,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-11-18 18:32:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 297 transitions. [2024-11-18 18:32:56,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-18 18:32:56,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:56,653 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] [2024-11-18 18:32:56,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 18:32:56,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:56,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2031190326, now seen corresponding path program 1 times [2024-11-18 18:32:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:56,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245916557] [2024-11-18 18:32:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:32:57,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245916557] [2024-11-18 18:32:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245916557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:57,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:32:57,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 18:32:57,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296668185] [2024-11-18 18:32:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:57,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 18:32:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 18:32:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 18:32:57,146 INFO L87 Difference]: Start difference. First operand 220 states and 297 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-11-18 18:32:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:57,319 INFO L93 Difference]: Finished difference Result 520 states and 702 transitions. [2024-11-18 18:32:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 18:32:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 142 [2024-11-18 18:32:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:57,321 INFO L225 Difference]: With dead ends: 520 [2024-11-18 18:32:57,321 INFO L226 Difference]: Without dead ends: 303 [2024-11-18 18:32:57,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 18:32:57,322 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 30 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:57,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 355 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 18:32:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-18 18:32:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 273. [2024-11-18 18:32:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 240 states have (on average 1.3375) internal successors, (321), 241 states have internal predecessors, (321), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-18 18:32:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 371 transitions. [2024-11-18 18:32:57,335 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 371 transitions. Word has length 142 [2024-11-18 18:32:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:57,335 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 371 transitions. [2024-11-18 18:32:57,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-11-18 18:32:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 371 transitions. [2024-11-18 18:32:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-18 18:32:57,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:57,336 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] [2024-11-18 18:32:57,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 18:32:57,336 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:57,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1888154417, now seen corresponding path program 1 times [2024-11-18 18:32:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86041434] [2024-11-18 18:32:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:57,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 18:32:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809083329] [2024-11-18 18:32:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:57,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:57,401 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 18:32:57,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 18:32:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 18:32:57,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 18:32:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 18:32:57,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 18:32:57,695 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 18:32:57,696 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 18:32:57,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-18 18:32:57,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-18 18:32:57,901 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:32:57,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 18:32:57,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:32:57 BoogieIcfgContainer [2024-11-18 18:32:57,979 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 18:32:57,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 18:32:57,980 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 18:32:57,980 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 18:32:57,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:32:41" (3/4) ... [2024-11-18 18:32:57,982 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 18:32:57,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 18:32:57,984 INFO L158 Benchmark]: Toolchain (without parser) took 16973.17ms. Allocated memory was 142.6MB in the beginning and 446.7MB in the end (delta: 304.1MB). Free memory was 70.8MB in the beginning and 301.3MB in the end (delta: -230.4MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2024-11-18 18:32:57,984 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:32:57,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.49ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 55.0MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 18:32:57,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.36ms. Allocated memory is still 142.6MB. Free memory was 55.0MB in the beginning and 112.1MB in the end (delta: -57.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-18 18:32:57,985 INFO L158 Benchmark]: Boogie Preprocessor took 75.55ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 112.1MB in the beginning and 182.0MB in the end (delta: -69.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-18 18:32:57,985 INFO L158 Benchmark]: RCFGBuilder took 402.47ms. Allocated memory is still 211.8MB. Free memory was 182.0MB in the beginning and 157.9MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-18 18:32:57,985 INFO L158 Benchmark]: TraceAbstraction took 16111.88ms. Allocated memory was 211.8MB in the beginning and 446.7MB in the end (delta: 234.9MB). Free memory was 157.9MB in the beginning and 302.3MB in the end (delta: -144.4MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2024-11-18 18:32:57,985 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 446.7MB. Free memory is still 301.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:32:57,986 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.15ms. Allocated memory is still 142.6MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.49ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 55.0MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.36ms. Allocated memory is still 142.6MB. Free memory was 55.0MB in the beginning and 112.1MB in the end (delta: -57.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.55ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 112.1MB in the beginning and 182.0MB in the end (delta: -69.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 402.47ms. Allocated memory is still 211.8MB. Free memory was 182.0MB in the beginning and 157.9MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16111.88ms. Allocated memory was 211.8MB in the beginning and 446.7MB in the end (delta: 234.9MB). Free memory was 157.9MB in the beginning and 302.3MB in the end (delta: -144.4MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 446.7MB. Free memory is still 301.3MB. 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 136, overapproximation of shiftLeft at line 136. Possible FailurePath: [L25] unsigned char isInitial = 0; [L26] double var_1_1 = 5.5; [L27] signed char var_1_2 = 100; [L28] signed short int var_1_3 = 1; [L29] signed long int var_1_4 = -16; [L30] signed long int var_1_5 = -64; [L31] signed char var_1_6 = 10; [L32] signed char var_1_7 = 5; [L33] double var_1_8 = 16.25; [L34] double var_1_9 = 1.8; [L35] unsigned char var_1_10 = 32; [L36] unsigned char var_1_11 = 64; [L37] unsigned short int var_1_12 = 16; [L38] unsigned long int var_1_13 = 128; [L39] unsigned char var_1_15 = 1; [L40] unsigned short int var_1_16 = 256; [L41] unsigned short int var_1_17 = 8; [L42] signed char var_1_18 = -2; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=100, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L100] var_1_2 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L103] var_1_3 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L104] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L106] var_1_4 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L107] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L108] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L108] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L109] var_1_5 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L110] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L111] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L111] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L113] var_1_6 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L114] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] var_1_7 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=65/4, var_1_9=9/5] [L117] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=65/4, var_1_9=9/5] [L118] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=65/4, var_1_9=9/5] [L118] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=65/4, var_1_9=9/5] [L119] var_1_8 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_9=9/5] [L120] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_9=9/5] [L121] var_1_9 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L122] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L123] var_1_11 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L124] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L125] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L125] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L126] var_1_15 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L127] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L128] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L128] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L129] var_1_17 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L130] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L131] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L131] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L144] RET updateVariables() [L145] CALL step() [L72] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L72] COND FALSE !((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) [L79] COND TRUE var_1_6 <= (var_1_4 + var_1_7) [L80] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L84] COND TRUE ((var_1_6 >> 2) * var_1_10) > var_1_4 [L85] var_1_12 = var_1_6 VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L87] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L87] COND FALSE !((1 << var_1_2) != (-500 / -100)) [L94] var_1_13 = var_1_6 VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1] [L96] CALL functionized3(var_1_17, var_1_8, var_1_10, var_1_9, var_1_15, 256) [L53] COND FALSE !((- functionized3_localFunctionVar3) <= functionized3_localFunctionVar1) [L66] var_1_16 = functionized3_localFunctionVar2 VAL [functionized3_localFunctionVar0=19, functionized3_localFunctionVar4=0, isInitial=1, localFunctionVar5=256, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=9, var_1_17=19, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=3, var_1_9=2] [L96] RET functionized3(var_1_17, var_1_8, var_1_10, var_1_9, var_1_15, 256) [L97] var_1_18 = var_1_3 VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=9, var_1_17=19, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=3, var_1_9=2] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=9, var_1_17=19, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=3, var_1_9=2] [L136] EXPR ((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=9, var_1_17=19, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=3, var_1_9=2] [L136] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=9, var_1_17=19, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=3, var_1_9=2] [L136] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=9, var_1_17=19, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=3, var_1_9=2] [L136] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=9, var_1_17=19, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=3, var_1_9=2] [L136-L137] return (((((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_2) ? ((var_1_17 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=9, var_1_17=19, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=3, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=-247, var_1_11=-247, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=9, var_1_17=19, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=7, var_1_5=3, var_1_6=7, var_1_7=1, var_1_8=3, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 11, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1130 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1128 mSDsluCounter, 4058 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2775 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2008 IncrementalHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 1283 mSDtfsCounter, 2008 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1357 GetRequests, 1245 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=10, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 594 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 2671 NumberOfCodeBlocks, 2671 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2648 ConstructedInterpolants, 0 QuantifiedInterpolants, 10123 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2373 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 15584/15960 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-11-18 18:32:58,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.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 b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 18:32:59,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 18:32:59,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 18:32:59,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 18:32:59,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 18:32:59,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 18:32:59,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 18:32:59,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 18:32:59,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 18:32:59,863 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 18:32:59,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 18:32:59,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 18:32:59,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 18:32:59,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 18:32:59,864 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 18:32:59,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 18:32:59,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 18:32:59,865 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 18:32:59,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 18:32:59,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 18:32:59,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 18:32:59,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 18:32:59,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 18:32:59,869 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 18:32:59,870 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 18:32:59,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 18:32:59,871 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 18:32:59,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 18:32:59,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 18:32:59,871 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 18:32:59,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 18:32:59,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 18:32:59,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 18:32:59,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 18:32:59,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:32:59,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 18:32:59,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 18:32:59,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 18:32:59,879 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 18:32:59,880 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 18:32:59,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 18:32:59,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 18:32:59,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 18:32:59,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 18:32:59,880 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 -> b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be [2024-11-18 18:33:00,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 18:33:00,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 18:33:00,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 18:33:00,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 18:33:00,133 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 18:33:00,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-18 18:33:01,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 18:33:01,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 18:33:01,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-18 18:33:01,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2753c89e5/a6941c2929ff42a9886de043e576b1ba/FLAG9b16e11dd [2024-11-18 18:33:01,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2753c89e5/a6941c2929ff42a9886de043e576b1ba [2024-11-18 18:33:01,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 18:33:01,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 18:33:01,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 18:33:01,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 18:33:01,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 18:33:01,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:33:01" (1/1) ... [2024-11-18 18:33:01,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ac4cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:01, skipping insertion in model container [2024-11-18 18:33:01,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:33:01" (1/1) ... [2024-11-18 18:33:01,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 18:33:02,119 WARN L250 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_codestructure_functionizing_file-9.i[919,932] [2024-11-18 18:33:02,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:33:02,173 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 18:33:02,182 WARN L250 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_codestructure_functionizing_file-9.i[919,932] [2024-11-18 18:33:02,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:33:02,231 INFO L204 MainTranslator]: Completed translation [2024-11-18 18:33:02,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02 WrapperNode [2024-11-18 18:33:02,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 18:33:02,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 18:33:02,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 18:33:02,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 18:33:02,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,280 INFO L138 Inliner]: procedures = 31, calls = 38, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2024-11-18 18:33:02,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 18:33:02,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 18:33:02,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 18:33:02,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 18:33:02,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,305 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 18:33:02,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 18:33:02,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 18:33:02,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 18:33:02,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 18:33:02,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2024-11-18 18:33:02,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:33:02,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:33:02,357 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-11-18 18:33:02,371 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-11-18 18:33:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 18:33:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 18:33:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 18:33:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 18:33:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 18:33:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 18:33:02,468 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 18:33:02,473 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 18:33:02,797 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-18 18:33:02,797 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 18:33:02,808 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 18:33:02,809 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 18:33:02,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:02 BoogieIcfgContainer [2024-11-18 18:33:02,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 18:33:02,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 18:33:02,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 18:33:02,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 18:33:02,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:33:01" (1/3) ... [2024-11-18 18:33:02,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da17b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:33:02, skipping insertion in model container [2024-11-18 18:33:02,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (2/3) ... [2024-11-18 18:33:02,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da17b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:33:02, skipping insertion in model container [2024-11-18 18:33:02,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:02" (3/3) ... [2024-11-18 18:33:02,814 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-9.i [2024-11-18 18:33:02,825 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 18:33:02,825 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 18:33:02,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 18:33:02,870 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;@27b163e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 18:33:02,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 18:33:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 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-11-18 18:33:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-18 18:33:02,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:33:02,895 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] [2024-11-18 18:33:02,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:33:02,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:33:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1971917253, now seen corresponding path program 1 times [2024-11-18 18:33:02,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:33:02,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007763967] [2024-11-18 18:33:02,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:33:02,909 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-11-18 18:33:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:33:02,911 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-11-18 18:33:02,912 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-11-18 18:33:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:33:03,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 18:33:03,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:33:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:33:03,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:33:03,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 18:33:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007763967] [2024-11-18 18:33:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007763967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:33:03,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:33:03,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 18:33:03,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562831736] [2024-11-18 18:33:03,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:33:03,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 18:33:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 18:33:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 18:33:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 18:33:03,182 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-18 18:33:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:33:03,206 INFO L93 Difference]: Finished difference Result 125 states and 213 transitions. [2024-11-18 18:33:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 18:33:03,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 132 [2024-11-18 18:33:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:33:03,217 INFO L225 Difference]: With dead ends: 125 [2024-11-18 18:33:03,217 INFO L226 Difference]: Without dead ends: 62 [2024-11-18 18:33:03,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-11-18 18:33:03,224 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 18:33:03,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:33:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-18 18:33:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-18 18:33:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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-11-18 18:33:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-18 18:33:03,264 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 132 [2024-11-18 18:33:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:33:03,265 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-18 18:33:03,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-18 18:33:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-18 18:33:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-18 18:33:03,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:33:03,267 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] [2024-11-18 18:33:03,275 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 (2)] Ended with exit code 0 [2024-11-18 18:33:03,468 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-11-18 18:33:03,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:33:03,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:33:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2079072756, now seen corresponding path program 1 times [2024-11-18 18:33:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:33:03,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634702044] [2024-11-18 18:33:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:33:03,470 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-11-18 18:33:03,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:33:03,471 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-11-18 18:33:03,472 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-11-18 18:33:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:33:03,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 18:33:03,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:33:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 129 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-18 18:33:04,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:33:04,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 18:33:04,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634702044] [2024-11-18 18:33:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634702044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:33:04,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [504655307] [2024-11-18 18:33:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:33:04,748 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-18 18:33:04,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-18 18:33:04,767 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-18 18:33:04,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-18 18:33:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:33:05,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-18 18:33:05,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:33:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 129 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-18 18:33:06,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:33:06,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [504655307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:33:06,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 18:33:06,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-18 18:33:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959194959] [2024-11-18 18:33:06,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 18:33:06,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 18:33:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 18:33:06,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 18:33:06,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-18 18:33:06,104 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-18 18:33:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:33:06,945 INFO L93 Difference]: Finished difference Result 137 states and 192 transitions. [2024-11-18 18:33:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 18:33:06,953 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 134 [2024-11-18 18:33:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:33:06,957 INFO L225 Difference]: With dead ends: 137 [2024-11-18 18:33:06,957 INFO L226 Difference]: Without dead ends: 78 [2024-11-18 18:33:06,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2024-11-18 18:33:06,959 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 94 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 18:33:06,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 265 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 18:33:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-18 18:33:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-18 18:33:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 18:33:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2024-11-18 18:33:06,972 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 134 [2024-11-18 18:33:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:33:06,972 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2024-11-18 18:33:06,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-18 18:33:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2024-11-18 18:33:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-18 18:33:06,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:33:06,974 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] [2024-11-18 18:33:06,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-18 18:33:07,182 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 (3)] Ended with exit code 0 [2024-11-18 18:33:07,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-11-18 18:33:07,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:33:07,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:33:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1406547914, now seen corresponding path program 1 times [2024-11-18 18:33:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:33:07,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991769038] [2024-11-18 18:33:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:33:07,377 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-11-18 18:33:07,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:33:07,380 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-11-18 18:33:07,380 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-11-18 18:33:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:33:07,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-18 18:33:07,558 INFO L278 TraceCheckSpWp]: Computing forward predicates...